Sciweavers

905 search results - page 19 / 181
» On the Complexity of uSPR Distance
Sort
View
ICIP
2010
IEEE
13 years 6 months ago
Earth Mover Distance on superpixels
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
Sylvain Boltz, Frank Nielsen, Stefano Soatto
ADHOCNOW
2008
Springer
14 years 2 months ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...
ECAL
2001
Springer
14 years 28 days ago
Taxonomy in Alife. Measures of Similarity for Complex Artificial Organisms
In this paper a formal approach to construction of a similarity measure for complex creatures is presented. The simulation model is described, and a Framsticks agent is expressed i...
Maciej Komosinski, Marek Kubiak
AAAI
2007
13 years 10 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su
CVPR
2008
IEEE
14 years 10 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs