Sciweavers

5580 search results - page 1010 / 1116
» Randomized priority algorithms
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 3 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 2 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour
JAIR
2011
129views more  JAIR 2011»
13 years 2 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
NECO
2011
13 years 2 months ago
Least-Squares Independent Component Analysis
Accurately evaluating statistical independence among random variables is a key element of Independent Component Analysis (ICA). In this paper, we employ a squared-loss variant of ...
Taiji Suzuki, Masashi Sugiyama
« Prev « First page 1010 / 1116 Last » Next »