308 search results - page 58 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
MP
2002
14 years 9 months ago
2002
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
ICDE
2012
IEEE
13 years 16 hour ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...