Sciweavers

432 search results - page 1 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
PODS
2010
ACM
215views Database» more  PODS 2010»
13 years 9 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ICDT
2009
ACM
147views Database» more  ICDT 2009»
14 years 5 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
13 years 9 months ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
ICALP
2001
Springer
13 years 9 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
CEC
2010
IEEE
13 years 5 months ago
Many-objective Distinct Candidates Optimization using Differential Evolution on centrifugal pump design problems
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...
Peter Dueholm Justesen, Rasmus K. Ursem