91 search results - page 9 / 19 » On random points in the unit disk |
109
click to vote
RSA
2011
14 years 6 months ago
2011
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
108
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
110
click to vote
EWSN
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
The non-negativity of color signals implies that they span a conical space with a hyperbolic geometry. We use perspective projections to separate intensity from chromaticity, and ...