Sciweavers

8413 search results - page 271 / 1683
» Ordering Problem Subgoals
Sort
View
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
15 years 9 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
CP
2005
Springer
15 years 8 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
ICALP
2007
Springer
15 years 7 months ago
Distributed Computing with Advice: Information Sensitivity of Graph Coloring
Abstract. We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required s...
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas,...
MST
2008
124views more  MST 2008»
15 years 3 months ago
Complexity of Clausal Constraints Over Chains
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
IJCV
2007
174views more  IJCV 2007»
15 years 2 months ago
Automatic Panoramic Image Stitching using Invariant Features
This paper concerns the problem of fully automated panoramic image stitching. Though the 1D problem (single axis of rotation) is well studied, 2D or multi-row stitching is more di...
Matthew Brown, David G. Lowe