Sciweavers

126 search results - page 3 / 26
» A Framework for Efficient Minimum Distance Computations
Sort
View
ICIP
2009
IEEE
14 years 8 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
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...
Angel D. Sappa, Mohammad Rouhani
CVPR
1998
IEEE
14 years 10 months ago
Markov Random Fields with Efficient Approximations
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...
Yuri Boykov, Olga Veksler, Ramin Zabih
EMMCVPR
2007
Springer
14 years 15 days ago
Efficient Shape Matching Via Graph Cuts
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...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
MOBIHOC
2002
ACM
14 years 8 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
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...
Suman Banerjee, Archan Misra
ISBI
2007
IEEE
14 years 2 months ago
An Effective and Efficient Technique for Searching for Similar Brain Activation Patterns
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...
Jingjing Zhang, Vasileios Megalooikonomou