555 search results - page 4 / 111 » Linear decomposition algorithm for VLSI design applications |
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
ISQED
2008
IEEE
15 years 4 months ago
2008
IEEE
Large-scale process fluctuations (particularly random device mismatches) at nanoscale technologies bring about highdimensional strongly nonlinear performance variations that canno...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...