260 search results - page 10 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
149
click to vote
CRV
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
128
click to vote
3DPVT
2006
IEEE
15 years 9 months ago
2006
IEEE
A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (...
161
click to vote
PROPERTYTESTING
2010
15 years 28 days ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
148
click to vote
CORR
2010
Springer
15 years 13 days ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
119
click to vote
AINA
2010
IEEE
15 years 7 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...