Sciweavers

1120 search results - page 129 / 224
» time 1999
Sort
View
STACS
1999
Springer
15 years 5 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ICCV
1999
IEEE
16 years 2 months ago
Differential Matching Constraints
We introduce a finite difference expansion for closely spaced cameras in projective vision, and use it to derive differential analogues of the finite-displacement projective match...
Bill Triggs
97
Voted
ICLP
1999
Springer
15 years 5 months ago
Comparing Trailing and Copying for Constraint Programming
A central service of a constraint programming system is search. In almost all constraint programming systems search is based on trailing, which is well understood and known to be ...
Christian Schulte
AI
1999
Springer
15 years 12 days ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
93
Voted
ICCBR
1999
Springer
15 years 5 months ago
When Experience Is Wrong: Examining CBR for Changing Tasks and Environments
Case-based problem-solving systems reason and learn from experiences, building up case libraries of problems and solutions to guide future reasoning. The expected bene ts of this l...
David B. Leake, David C. Wilson