1957 search results - page 40 / 392 » Approximate algorithms for neural-Bayesian approaches |
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
WACV
2005
IEEE
15 years 3 months ago
2005
IEEE
As interest in 3D face recognition increases the importance of the initial alignment problem does as well. In this paper we present a method utilizing the registered 2D color and ...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
182
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...