Sciweavers

2398 search results - page 5 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 7 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
IJCV
2002
156views more  IJCV 2002»
13 years 7 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
PLDI
2004
ACM
14 years 23 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 7 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia