179 search results - page 17 / 36 » On Approximating the Average Distance Between Points |
114
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
100
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
CGI
1998
IEEE
15 years 4 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...