Sciweavers

352 search results - page 6 / 71
» On implementation choices for iterative improvement partitio...
Sort
View
CAD
2008
Springer
15 years 1 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
ICCAD
1997
IEEE
121views Hardware» more  ICCAD 1997»
15 years 6 months ago
Adaptive methods for netlist partitioning
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...
Wray L. Buntine, Lixin Su, A. Richard Newton, Andr...
DAGSTUHL
2007
15 years 3 months ago
An Inner/Outer Stationary Iteration for Computing PageRank
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
Andrew P. Gray, Chen Greif, Tracy Lau
EUC
2006
Springer
15 years 5 months ago
Custom Instruction Generation Using Temporal Partitioning Techniques for a Reconfigurable Functional Unit
Extracting appropriate custom instructions is an important phase for implementing an application on an extensible processor with a reconfigurable functional unit (RFU). Custom inst...
Farhad Mehdipour, Hamid Noori, Morteza Saheb Zaman...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
15 years 10 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh