728 search results - page 66 / 146 » Efficient Searching with Linear Constraints |
177
click to vote
AI
1999
Springer
15 years 5 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
167
Voted
ISMIS
2000
Springer
15 years 9 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
126
click to vote
FLAIRS
2008
15 years 8 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
161
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
169
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper proposes a new approach to 3D reconstruction of piecewise planar objects based on two image regularities, connectivity and perspective symmetry. First, we formulate the...