Sciweavers

220 search results - page 9 / 44
» SMOS L1 algorithms
Sort
View
STACS
2010
Springer
14 years 2 months ago
Quantum Algorithms for Testing Properties of Distributions
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
ICCSA
2003
Springer
14 years 26 days ago
A Fast Algorithm for Moving Interface Problems
Numerical simulations of a spherical shock refraction have been successfully conducted by a front tracking method. We demonstrate the e ciency of the front tracking algorithm by co...
Srabasti Dutta, James Glimm, John W. Grove, David ...
ACMMSP
2006
ACM
260views Hardware» more  ACMMSP 2006»
14 years 1 months ago
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
Michael D. Adams, David S. Wise
ICML
2009
IEEE
14 years 8 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
IJON
2008
124views more  IJON 2008»
13 years 7 months ago
A dynamic algorithm for blind separation of convolutive sound mixtures
We study an efficient dynamic blind source separation algorithm of convolutive sound mixtures based on updating statistical information in the frequency domain, and minimizing the...
Jie Liu, Jack Xin, Yingyong Qi