Sciweavers

835 search results - page 20 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
OL
2011
177views Neural Networks» more  OL 2011»
13 years 1 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
UAI
2003
13 years 11 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 10 months ago
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
Marcin Bienkowski
ICASSP
2011
IEEE
13 years 2 months ago
Adaptive reconstruction method of missing textures based on perceptually optimized algorithm
This paper presents an adaptive reconstruction method of missing textures based on structural similarity (SSIM) index. The proposed method firstly performs SSIM-based selection o...
Takahiro Ogawa, Miki Haseyama