Sciweavers

9176 search results - page 345 / 1836
» algorithms 2010
Sort
View
TASLP
2010
148views more  TASLP 2010»
15 years 1 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
TMI
2010
298views more  TMI 2010»
15 years 1 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
A proof Procedure for Testing Membership in Regular Expressions
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
Keehang Kwon, Hong Pyo Ha, Jiseung Kim
SIAMJO
2010
125views more  SIAMJO 2010»
15 years 1 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
ECCC
2000
117views more  ECCC 2000»
15 years 6 months ago
On Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
Oded Goldreich, Dana Ron