555 search results - page 7 / 111 » Linear decomposition algorithm for VLSI design applications |
VLSID
1996
IEEE
15 years 1 months ago
1996
IEEE
Simulated annealing based standard cell placement for VLSI designs has long been acknowledged as a compute-intensive process, and as a result several research efforts have been un...
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
IANDC
2006
14 years 9 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
If motion estimation can choose the most suitable algorithm according to the changing characteristics of input image signals, we can get benefits, which improve quality and perfor...