Sciweavers

1434 search results - page 183 / 287
» Graph Searching with Advice
Sort
View
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 10 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
MVA
1994
13 years 10 months ago
Robust Line Drawing Understanding Incorporating Efficient Closed Symbols Extraction
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
Shin'ichi Satoh, Hiroshi Mo, Masao Sakauchi
AMAI
2005
Springer
13 years 9 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder
JAIR
2010
145views more  JAIR 2010»
13 years 7 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon

Lecture Notes
443views
15 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount