3341 search results - page 515 / 669 » On Bounded Queries and Approximation |
161
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
139
Voted
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
164
click to vote
EDBT
2009
ACM
15 years 9 months ago
2009
ACM
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
238
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
175
Voted
SISAP
2009
IEEE
16 years 15 days ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...