6437 search results - page 928 / 1288 » Parallel Algorithms for Arrangements |
166
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
160
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
Paper architectures are 3D paper buildings created by folding and cutting. The creation process of paper architecture is often laborintensive and highly skill-demanding, even with...
154
click to vote
ISCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
196
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes a polynomial time algorithm for min-area retiming for edge-triggered circuits to handle both setup and hold constraints. Given a circuit G and a target clock ...
145
Voted
IV
1999
IEEE
15 years 11 months ago
1999
IEEE
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware a...