308 search results - page 50 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
76
Voted
MOC
2000
14 years 9 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
108
click to vote
JCST
2008
14 years 9 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
MST
2010
14 years 8 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
102
click to vote
ICPADS
2006
IEEE
15 years 3 months ago
2006
IEEE
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...