876 search results - page 157 / 176 » Propagating Class and Method Combination |
108
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
The joint tasks of object recognition and object segmentation from a single image are complex in their requirement of not only correct classification, but also deciding exactly whi...
105
click to vote
ICML
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
120
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Markov random fields (MRFs) are popular and generic probabilistic models of prior knowledge in low-level vision. Yet their generative properties are rarely examined, while applica...
104
click to vote
CAV
2009
Springer
15 years 8 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
ICIP
2007
IEEE
15 years 7 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...