2107 search results - page 84 / 422 » Computing Small Search Numbers in Linear Time |
118
click to vote
WEBDB
2009
Springer
15 years 10 months ago
2009
Springer
With the rise of cloud computing, it is increasingly attractive for end-users (organizations and individuals) to outsource the management of their data to a small number of larges...
120
click to vote
FOCS
1989
IEEE
15 years 7 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
113
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
147
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
116
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...