3172 search results - page 80 / 635 » On the Random-Self-Reducibility of Complete Sets |
129
Voted
AI
2011
Springer
14 years 7 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
98
Voted
STACS
1993
Springer
15 years 4 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...
IJCAI
1997
15 years 2 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
109
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Analytic manifolds were recently used for motion averaging, segmentation and robust estimation. Here we consider the epipolar constraint for calibrated cameras, which is the most ...
110
Voted
ICIP
2008
IEEE
15 years 7 months ago
2008
IEEE
Widely used SVD-based matrix factorization approaches to the recovery of 3D rigid structure from motion (SFM), require a set of feature points to be visible in a set of images. Wh...