Sciweavers

215 search results - page 4 / 43
» Sums of squares based approximation algorithms for MAX-SAT
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 7 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICIP
2006
IEEE
14 years 9 months ago
Fast Non-Local Algorithm for Image Denoising
For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm th...
Jin Wang, Yanwen Guo, Yiting Ying, Yanli Liu, Quns...
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
13 years 7 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
ECAI
2006
Springer
13 years 11 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
CDC
2008
IEEE
148views Control Systems» more  CDC 2008»
14 years 1 months ago
Convergence rate for stochastic consensus algorithms with time-varying noise statistics: Asymptotic normality
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
Minyi Huang