Sciweavers

689 search results - page 38 / 138
» Metrics for more than two points at once
Sort
View
CCCG
2007
14 years 11 months ago
Approximate Shortest Descent Path on a Terrain
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
Sasanka Roy, Sachin Lodha, Sandip Das, Anil Mahesh...
AI
2011
Springer
14 years 4 months ago
Representing preferences using intervals
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
Meltem Öztürk, Marc Pirlot, Alexis Tsouk...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 3 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
CORR
2000
Springer
128views Education» more  CORR 2000»
14 years 9 months ago
Faster Evaluation of Multidimensional Integrals
In a recent paper Keister proposed two quadrature rules as alternatives to Monte Carlo for certain multidimensional integrals and reported his test results. In earlier work we had...
Anargyros Papageorgiou, Joseph F. Traub
NIPS
2003
14 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand