126 search results - page 3 / 26 » A Framework for Efficient Minimum Distance Computations |
207
click to vote
ICIP
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper presents a novel approach for estimating the shortest
Euclidean distance from a given point to the corresponding
implicit quadric fitting surface. It first estimates t...
156
click to vote
CVPR
1998
IEEE
16 years 7 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
188
click to vote
EMMCVPR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
252
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
147
click to vote
ISBI
2007
IEEE
16 years 4 days ago
2007
IEEE
In this paper, we introduce a new approach for content-based similarity search for brain images. Based on the keyblock representation, our framework employs the Principal Componen...