Sciweavers

1477 search results - page 35 / 296
» Random Convex Programs
Sort
View
JAIR
2006
143views more  JAIR 2006»
13 years 8 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
JSAC
2008
111views more  JSAC 2008»
13 years 8 months ago
The end-to-end rate control in multiple-hop wireless networks: Cross-layer formulation and optimal allocation
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...
Chengnian Long, Bo Li, Qian Zhang, Bin Zhao, Bo Ya...
IJCNN
2006
IEEE
14 years 2 months ago
Learning the Kernel in Mahalanobis One-Class Support Vector Machines
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
Ivor W. Tsang, James T. Kwok, Shutao Li
TASLP
2010
78views more  TASLP 2010»
13 years 3 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney