3415 search results - page 498 / 683 » Lower bounds on kernelization |
181
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
177
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
230
click to vote
ICDE
2012
IEEE
14 years 5 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
177
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
184
click to vote
ICDE
2012
IEEE
13 years 8 months 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...