1244 search results - page 2 / 249 » Searching in Higher Dimension |
SODA
1993
ACM
13 years 6 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
VISUALIZATION
2000
IEEE
13 years 9 months ago
2000
IEEE
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
ICPP
1999
IEEE
13 years 9 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...