89 search results - page 8 / 18 » CP Models for Maximum Common Subgraph Problems |
SIMVIS
2004
14 years 10 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
105
click to vote
VISAPP
2010
14 years 7 months ago
2010
phies are also mentioned and a common mathematical abstraction for all these inverses problems will be presented. By focusing on a simple linear forward model, first a synthetic an...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
PRL
2011
14 years 8 days ago
2011
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...