91 search results - page 11 / 19 » On random points in the unit disk |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
ICALP
2007
Springer
14 years 14 days ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
WSNA
2003
ACM
14 years 1 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
ICDCS
2010
IEEE
2010
IEEE
Link-Centric Probabilistic Coverage Model for Transceiver-Free Object Detection in Wireless Networks
13 years 9 months ago
Abstract--Sensing coverage is essential for most applications in wireless networks. In traditional coverage problem study, the disk coverage model has been widely applied because o...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...