1941 search results - page 199 / 389 » On the Hardness of Approximate Reasoning |
170
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
It has recently been shown that deformable 3D surfaces
could be recovered from single video streams. However, ex-
isting techniques either require a reference view in which
the ...
180
click to vote
CVPR
2005
IEEE
16 years 8 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...
151
click to vote
ICCV
2005
IEEE
16 years 8 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...
143
click to vote
ICML
2005
IEEE
16 years 7 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...
167
click to vote
ICML
1999
IEEE
16 years 7 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...