796 search results - page 102 / 160 » Approximating the centroid is hard |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Researchers have been working on human face recognition for decades. Face recognition is hard due to different types of variations in face images, such as pose, illumination and e...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...