Sciweavers

4313 search results - page 373 / 863
» Using time travel to diagnose computer problems
Sort
View
CCCG
2008
15 years 9 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath
FOCS
2002
IEEE
16 years 16 days ago
A Dichotomy Theorem for Constraints on a Three-Element Set
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
Andrei A. Bulatov
ECCV
2002
Springer
16 years 9 months ago
A Reflective Symmetry Descriptor
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
Michael M. Kazhdan, Bernard Chazelle, David P. Dob...
SAC
1998
ACM
15 years 11 months ago
Off-line scheduling of a real-time system
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
Klaus Schild, Jörg Würtz
JPDC
2006
85views more  JPDC 2006»
15 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...