367 search results - page 12 / 74 » Tight lower bounds for the online labeling problem |
TALG
2010
13 years 5 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
DMTCS
2010
13 years 4 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
SWAT
2004
Springer
14 years 25 days ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
PODC
2009
ACM
14 years 8 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...