100 search results - page 12 / 20 » Unicyclic Components in Random Graphs |
108
click to vote
NIPS
2007
15 years 2 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
155
click to vote
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
168
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
117
click to vote
IMAMS
2003
15 years 2 months ago
2003
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
120
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...