419 search results - page 15 / 84 » Constraint models for graceful graphs |
SMA
2003
ACM
14 years 20 days ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose a novel generative language for shape that is based on the shock graph: given a shock graph topology, we explore constraints on the geometry and dynamics of the shock g...
SMI
2010
IEEE
13 years 5 months ago
2010
IEEE
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
DSD
2007
IEEE
14 years 1 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
DATE
2002
IEEE
14 years 11 days ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...