5153 search results - page 406 / 1031 » Introduction to Randomized Algorithms |
225
click to vote
IAT
2009
IEEE
16 years 2 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
224
click to vote
ALGOSENSORS
2007
Springer
16 years 1 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
209
click to vote
WONS
2005
IEEE
16 years 1 months ago
2005
IEEE
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
190
click to vote
COMPGEOM
2003
ACM
16 years 24 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
235
click to vote
SIGMETRICS
2010
ACM
16 years 11 days ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...