3341 search results - page 72 / 669 » On Bounded Queries and Approximation |
127
click to vote
JASIS
2010
15 years 2 months ago
2010
This study investigated a relatively unexamined query type, queries composed of URLs. The extent, variation and user click-through behavior was examined to determine the intent be...
148
Voted
COMPGEOM
1997
ACM
15 years 8 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...
146
click to vote
DOLAP
2005
ACM
15 years 5 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...
169
click to vote
SIGMOD
2004
ACM
16 years 4 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...
177
Voted
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...