Sciweavers

565 search results - page 53 / 113
» Geometry of Upper Probabilities
Sort
View
MOBIHOC
2001
ACM
14 years 9 months ago
A probabilistic analysis for the range assignment problem in ad hoc networks
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...
Paolo Santi, Douglas M. Blough, Feodor S. Vainstei...
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 7 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
GLOBECOM
2008
IEEE
14 years 4 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
GLOBECOM
2008
IEEE
14 years 4 months ago
Performance Analysis of a Partially Coherent System Using Constellation Rotation and Coordinate Interleaving
Abstract— The performance analysis of a system employing coordinate interleaving and constellation rotation, over Nakagamim fading channels, in the presence of phase noise as wel...
Nauman F. Kiyani, Jos H. Weber
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
14 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...