Sciweavers

29 search results - page 6 / 6
» Counting Solution Clusters in Graph Coloring Problems Using ...
Sort
View
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 4 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
ECCV
2006
Springer
14 years 6 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PAMI
2008
198views more  PAMI 2008»
13 years 4 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
CVPR
2008
IEEE
14 years 6 months ago
Matching images under unstable segmentations
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
Varsha Hedau, Himanshu Arora, Narendra Ahuja