Sciweavers

1082 search results - page 138 / 217
» Approximation Algorithms for Spreading Points
Sort
View
JAIR
2006
143views more  JAIR 2006»
13 years 9 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 3 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 2 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
WACV
2002
IEEE
14 years 2 months ago
Appearance-based Eye Gaze Estimation
We present a method for estimating eye gaze direction, which represents a departure from conventional eye gaze estimation methods, the majority of which are based on tracking spec...
Kar-Han Tan, David J. Kriegman, Narendra Ahuja
FGR
2004
IEEE
160views Biometrics» more  FGR 2004»
14 years 26 days ago
A Comparison of Shape Constrained Facial Feature Detectors
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
David Cristinacce, Timothy F. Cootes