3341 search results - page 258 / 669 » On Bounded Queries and Approximation |
202
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
162
click to vote
CIKM
2003
Springer
15 years 12 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
223
click to vote
COMGEO
2002
ACM
15 years 6 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
188
click to vote
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
191
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...