21 search results - page 3 / 5 » An Anytime Algorithm for Generalized Symmetry Detection in R... |
CP
2006
Springer
13 years 10 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
DAC
2004
ACM
14 years 7 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ECCV
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Eye detection is very important for automatic face recognition and gaze tracking. In this paper we propose an algorithm for eye detection under active infrared (IR) illumination. ...
DATE
2006
IEEE
14 years 29 days ago
2006
IEEE
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...