337 search results - page 47 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
TVCG
2011
13 years 4 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
EUROGRAPHICS
2010
Eurographics
14 years 6 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
ACCV
2006
Springer
14 years 3 months ago
2006
Springer
We developed a system including two modules: the texture analysis module and the texture synthesis module. The analysis module is capable of analyzing an input image and performing...
JMLR
2012
11 years 11 months ago
2012
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...