183 search results - page 24 / 37 » On the Matching Problem for Special Graph Classes |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
106
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
135
click to vote
PAMI
2010
14 years 12 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
108
click to vote
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
125
click to vote
DGCI
2009
Springer
15 years 4 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...