Sciweavers

152 search results - page 2 / 31
» Minimality in a Linear Calculus with Iteration
Sort
View
SIAMJO
2000
63views more  SIAMJO 2000»
13 years 5 months ago
Pattern Search Methods for Linearly Constrained Minimization
This paper deals with generalized pattern search (GPS) algorithms for linearly constrained optimization. At each iteration, the GPS algorithm generates a set of directions that con...
Robert Michael Lewis, Virginia Torczon
FOSSACS
2007
Springer
13 years 11 months ago
Iterator Types
Abstract. System L is a linear λ-calculus with numbers and an iterator, which, although imposing linearity restrictions on terms, has all the computational power of G¨odel’s Sy...
Sandra Alves, Maribel Fernández, Már...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
13 years 9 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
ICIP
2009
IEEE
14 years 6 months ago
Color De-quantizing Through Iterated Dynamic Hard Thresholding On An Overcomplete Representation
We propose a new color de-quantizing method for paletted images based on maximizing the sparseness of the overcomplete wavelet analysis of the estimation within the consistency se...
CORR
2011
Springer
282views Education» more  CORR 2011»
13 years 7 days ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin