Sciweavers

3049 search results - page 49 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICIP
2009
IEEE
14 years 11 months ago
Total variation projection with first order schemes
This article proposes a new algorithm to compute the projection on the set of images whose total variation is bounded by a constant. The projection is computed through a dual form...
Mohamed-Jalal Fadili, Gabriel Peyré
NIPS
2000
15 years 3 months ago
From Margin to Sparsity
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson
MICRO
2006
IEEE
73views Hardware» more  MICRO 2006»
15 years 8 months ago
Merging Head and Tail Duplication for Convergent Hyperblock Formation
VLIW and EDGE (Explicit Data Graph Execution) architectures rely on compilers to form high-quality hyperblocks for good performance. These compilers typically perform hyperblock f...
Bertrand A. Maher, Aaron Smith, Doug Burger, Kathr...
TNN
2010
182views Management» more  TNN 2010»
14 years 8 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 1 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard