Sciweavers

13376 search results - page 156 / 2676
» Problem Solving with
Sort
View
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
15 years 7 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
SPIRE
2010
Springer
15 years 1 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
CAD
2010
Springer
15 years 3 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
SAC
2006
ACM
15 years 9 months ago
Spatial geometric constraint solving based on k-connected graph decomposition
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Gui-Fang Zhang, Xiao-Shan Gao
CVPR
2011
IEEE
14 years 11 months ago
Particle Filter with State Permutations for Solving Image Jigsaw Puzzles
We deal with an image jigsaw puzzle problem, which is defined as reconstructing an image from a set of square and non-overlapping image patches. It is known that a general instan...
Xingwei Yang, Nagesh Adluru, LonginJan Latecki