432 search results - page 2 / 87 » An optimal algorithm for the distinct elements problem |
SWAT
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
ADC
2010
Springer
13 years 7 days ago
2010
Springer
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
COMPUTING
2008
13 years 5 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...