- Full text PDF available (5)
- This year (1)
- Last 5 years (6)
- Last 10 years (6)
Journals and Conferences
In this work, we introduce the Minimum Trilateration Problem, the problem of placing distance measuring guards in a polygon in order to locate points in the interior. We provide the first non-trivial bounds on trilaterating simple polygons, by showing that b 8N 9 c guards suffice for any non-degenerate polygon of N sides, and present an O(N logN) algorithm… (More)
Real-world networks often consist of multiple layers, be they infrastructure such as airline networks or social such as collaboration networks. A common aspect to these networks is that there are multiple sub-networks that evolve in parallel on the same node set -- these are referred to as multiplex networks. For example, in the case of airline networks,… (More)
We have measured the melting temperature of nanoscale indium islands on a WSe(2) substrate using perturbed angular correlations combined with scanning tunneling microscopy. The indium islands are self-assembled nanostructures whose diameter can vary between about 5 and 100 nm, depending on deposition conditions. The melting point decreases due to surface… (More)
There are two key properties of the above. First, given only c, Eve should not be able to learn what m is. Second, Dec(Enc(m)) = m, so that Bob can accurately determine the message that Alice wanted to send. Creating functions Enc and Dec which satisfy this is a fundamental problem of cryptography. But given the above encryption scheme, knowing what these… (More)
The conclusion was reached on the basis of statistically significant results that the tendency to cleft formation is significantly less in cast plates than in plastic plates, particularly in the region of the critical dorsal border zone.
• Definition of perfect secrecy • One-time pad and optimality (Shannon's theorem) • Definition of statistical one-time MAC and construction. Historically, cryptography was treated as a practical problem with practical applications. Many of these schemes were insecure due to a lack of a mathematical foundation combined with no understanding of desirable… (More)
We describe the mining and analysis of a coauthorship network, obtained by mining data from the ACM Digital Library. In addition to providing various basic properties of the network, we also provide preliminary results of using this network to run binary agreement model simulations, and the potential for committed minorities in the network.