1100 search results - page 35 / 220 » Approximate distance oracles |
121
click to vote
CGF
2010
14 years 7 months ago
2010
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
EUROCOLT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
VISUALIZATION
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper presents a framework for multiresolution compression and geometric reconstruction of arbitrarily dimensioned data designed for distributed applications. Although being ...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
CIKM
2003
Springer
15 years 3 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...