3341 search results - page 59 / 669 » On Bounded Queries and Approximation |
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
159
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
ALT
1998
Springer
15 years 2 months ago
1998
Springer
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
108
click to vote
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...