1088 search results - page 123 / 218 » A Bayesian Approach to Tackling Hard Computational Problems |
CVPR
2004
IEEE
15 years 24 days ago
2004
IEEE
Tracking articulated objects in image sequences remains a challenging problem, particularly in terms of the ability to localize the individual parts of an object given selfocclusi...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
We address the problem of weakly supervised semantic segmentation. The training images are labeled only by the classes they contain, not by their location in the image. On test im...
ACMSE
2006
ACM
14 years 4 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
ICDM
2008
IEEE
14 years 5 months ago
2008
IEEE
Social interactions that occur regularly typically correspond to significant yet often infrequent and hard to detect interaction patterns. To identify such regular behavior, we p...
GFKL
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...