Sciweavers

3838 search results - page 464 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
SIAMIS
2010
190views more  SIAMIS 2010»
15 years 1 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
ISCA
2012
IEEE
234views Hardware» more  ISCA 2012»
13 years 9 months ago
PARDIS: A programmable memory controller for the DDRx interfacing standards
Modern memory controllers employ sophisticated address mapping, command scheduling, and power management optimizations to alleviate the adverse effects of DRAM timing and resource...
Mahdi Nazm Bojnordi, Engin Ipek
ICIP
1997
IEEE
16 years 8 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
144
Voted
GLOBECOM
2009
IEEE
16 years 1 months ago
A Fresh Look at Multicanonical Monte Carlo from a Telecom Perspective
—The Multicanonical Monte Carlo (MMC) technique is a new form of adaptive importance sampling (IS). Thanks to its blind adaptation algorithm, it does not require an in-depth syst...
Alberto Bononi, Leslie A. Rusch, Amirhossein Ghazi...
ICASSP
2008
IEEE
16 years 1 months ago
Adaptable K-nearest neighbor for image interpolation
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...
Kenta S. Ni, Truong Q. Nguyen