Sciweavers

2743 search results - page 187 / 549
» Minimization of an M-convex Function
Sort
View
ICASSP
2008
IEEE
16 years 29 days ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
COLT
2007
Springer
16 years 21 days ago
Resource-Bounded Information Gathering for Correlation Clustering
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
Pallika Kanani, Andrew McCallum
CORR
2004
Springer
91views Education» more  CORR 2004»
15 years 6 months ago
Distributed Control by Lagrangian Steepest Descent
Often adaptive, distributed control can be viewed as an iterated game between independent players. The coupling between the players' mixed strategies, arising as the system ev...
David Wolpert, Stefan Bieniawski
FOCM
2010
108views more  FOCM 2010»
15 years 5 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
UAI
2008
15 years 8 months ago
Refractor Importance Sampling
In this paper we introduce Refractor Importance Sampling (RIS), an improvement to reduce error variance in Bayesian network importance sampling propagation under evidential reason...
Haohai Yu, Robert van Engelen