388 search results - page 68 / 78 » Robust Lower Bounds for Communication and Stream Computation |
FCT
2005
Springer
15 years 4 months ago
2005
Springer
We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, i...
DC
2010
14 years 11 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
TSP
2008
14 years 11 months ago
2008
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
117
Voted
ASIAN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
115
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...