Sciweavers

942 search results - page 54 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
RT
1998
Springer
14 years 28 days ago
Interactively Modeling with Photogrammetry
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...
AAAI
2010
13 years 10 months ago
Propagating Conjunctions of AllDifferent Constraints
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
AAAI
2006
13 years 10 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
14 years 9 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
STACS
1991
Springer
14 years 7 days ago
The RELVIEW-System
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
Rudolf Berghammer, Gunther Schmidt