427 search results - page 82 / 86 » Computing the Local Consensus of Trees |
110
click to vote
NIPS
2007
15 years 1 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
136
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
127
click to vote
HASKELL
2009
ACM
15 years 6 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We present a latent hierarchical structural learning method for object detection. An object is represented by a mixture of hierarchical tree models where the nodes represent objec...
111
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...