1038 search results - page 14 / 208 » Space-Bounded Query Approximation |
136
Voted
COMPGEOM
1997
ACM
15 years 6 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
132
click to vote
DOLAP
2005
ACM
15 years 4 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
159
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
132
Voted
CIKM
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
129
click to vote
JIIS
2008
15 years 2 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...