1038 search results - page 14 / 208 » Space-Bounded Query Approximation |
109
click to vote
COMPGEOM
1997
ACM
15 years 3 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...
104
click to vote
DOLAP
2005
ACM
15 years 1 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...
120
click to vote
SIGMOD
2004
ACM
15 years 11 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...
CIKM
2006
Springer
15 years 3 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...
101
Voted
JIIS
2008
14 years 11 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...