7006 search results - page 313 / 1402 » Approximation Algorithms |
121
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
135
click to vote
JCO
2011
14 years 11 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
152
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
131
click to vote
SGP
2003
15 years 5 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
181
click to vote
TSMC
2010
14 years 10 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...