263 search results - page 26 / 53 » Combinatorial Shape Decomposition |
121
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
107
click to vote
CPM
1999
Springer
15 years 6 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
138
click to vote
CONSTRAINTS
2006
15 years 2 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
128
click to vote
CIARP
2004
Springer
15 years 7 months ago
2004
Springer
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
100
click to vote
ICIAP
2007
ACM
15 years 5 months ago
2007
ACM
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...