Sciweavers

126 search results - page 1 / 26
» A Framework for Efficient Minimum Distance Computations
Sort
View
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
13 years 9 months ago
A Framework for Efficient Minimum Distance Computations
In this paper we present a framework for minimum distance computations that allows efficient solution of minimum distance queries on a variety of surface representations, includin...
David E. Johnson, Elaine Cohen
ICCV
2003
IEEE
14 years 6 months ago
Minimum Risk Distance Measure for Object Recognition
Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. For ease of implementation and efficiency consi...
Shyjan Mahamud, Martial Hebert
DCOSS
2007
Springer
13 years 8 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
TASLP
2008
176views more  TASLP 2008»
13 years 4 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 8 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls