Sciweavers

393 search results - page 52 / 79
» Convex Programming Methods for Global Optimization
Sort
View
JMIV
2007
83views more  JMIV 2007»
15 years 1 months ago
Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal
Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficie...
Jian-Feng Cai, Raymond H. Chan, Carmine Di Fiore
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 3 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
SAGA
2009
Springer
15 years 8 months ago
Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
Boris Defourny, Damien Ernst, Louis Wehenkel
ICALP
2009
Springer
16 years 2 months ago
Proportional Response Dynamics in the Fisher Market
Abstract. In this paper, we show that the proportional response dynamics, a utility based distributed dynamics, converges to the market equilibrium in the Fisher market with consta...
Li Zhang
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 6 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi