Sciweavers

217 search results - page 19 / 44
» Elimination Graphs
Sort
View
ENC
2004
IEEE
13 years 11 months ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
TVLSI
2002
161views more  TVLSI 2002»
13 years 7 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
13 years 12 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
ICPR
2006
IEEE
14 years 8 months ago
Multiple Objects Tracking with Multiple Hypotheses Graph Representation
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
Alex Yong Sang Chia, Liyuan Li, Weimin Huang
PLDI
1990
ACM
13 years 11 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta