Sciweavers

86 search results - page 3 / 18
» A Theory of Indirection via Approximation
Sort
View
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
13 years 11 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
IACR
2011
141views more  IACR 2011»
12 years 6 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
ADCM
2010
129views more  ADCM 2010»
13 years 7 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
PAMI
2007
176views more  PAMI 2007»
13 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
TALG
2010
86views more  TALG 2010»
13 years 5 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez