308 search results - page 44 / 62 » Tight Lower Bounds for the Distinct Elements Problem |
164
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
78
Voted
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
100
click to vote
ACL
2011
14 years 1 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
80
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
166
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...