59 search results - page 6 / 12 » Parametric Representations of Boolean Constraints |
ENTCS
2008
14 years 11 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
113
click to vote
PAMI
2002
14 years 11 months ago
2002
Decomposing video frames into coherent two-dimensional motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that e...
100
click to vote
SAS
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
AAAI
1996
15 years 1 months ago
1996
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
116
click to vote
ACCV
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Estimation using homogeneous entities has to cope with obstacles such as singularities of covariance matrices and redundant parametrizations which do not allow an immedia...