Sciweavers

64 search results - page 10 / 13
» Locally Competitive Algorithms for Sparse Approximation
Sort
View
75
Voted
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 9 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
TIP
2011
255views more  TIP 2011»
14 years 4 months ago
Dictionary Learning for Stereo Image Representation
—One of the major challenges in multi-view imaging is the definition of a representation that reveals the intrinsic geometry of the visual information. Sparse image representati...
Ivana Tosic, Pascal Frossard
80
Voted
CVPR
2012
IEEE
12 years 12 months ago
KNN matting
We are interested in a general alpha matting approach for the simultaneous extraction of multiple image layers; each layer may have disjoint segments for material matting not limi...
Qifeng Chen, Dingzeyu Li, Chi-Keung Tang
CP
2003
Springer
15 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
JMLR
2006
153views more  JMLR 2006»
14 years 9 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis