4377 search results - page 357 / 876 » Mass problems and randomness |
176
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
196
click to vote
CISS
2007
IEEE
16 years 1 months ago
2007
IEEE
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
142
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
189
click to vote
P2P
2006
IEEE
16 years 25 days ago
2006
IEEE
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...
139
click to vote
CP
2004
Springer
16 years 6 days ago
2004
Springer
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...