210 search results - page 38 / 42 » Universal Booleanization of Constraint Models |
PASTE
2005
ACM
14 years 3 months ago
2005
ACM
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
IANDC
2011
13 years 4 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
DAGSTUHL
2007
13 years 11 months ago
2007
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
NCA
2007
IEEE
13 years 9 months ago
2007
IEEE
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...
PAMI
2007
13 years 9 months ago
2007
—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the orga...