Sciweavers

263 search results - page 8 / 53
» Combinatorial Shape Decomposition
Sort
View
MFCS
2005
Springer
15 years 5 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
SAC
2009
ACM
15 years 6 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
INFOCOM
2008
IEEE
15 years 6 months ago
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
Sol Lederer, Yue Wang, Jie Gao
ICPR
2008
IEEE
16 years 27 days ago
A coordinate system for articulated 2D shape point correspondences
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
Adrian Ion, Salvador B. López Mármol...