3341 search results - page 72 / 669 » On Bounded Queries and Approximation |
JASIS
2010
14 years 8 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...
101
click to vote
COMPGEOM
1997
ACM
15 years 2 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...
DOLAP
2005
ACM
14 years 11 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...
108
click to vote
SIGMOD
2004
ACM
15 years 10 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...
119
click to vote
MFCS
2001
Springer
15 years 2 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...