2398 search results - page 84 / 480 » Constraint Programming and Graph Algorithms |
123
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
126
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
121
Voted
DAC
1999
ACM
16 years 5 months ago
1999
ACM
Abstract? Fixed-point DSPs are a class of embedded processors with highly irregular architectures. This irregularity makes it difficult to generate high-quality machine code from p...
187
click to vote
CLA
2007
15 years 6 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
152
click to vote
TSE
2010
15 years 3 months ago
2010
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...