Sciweavers

12265 search results - page 2228 / 2453
» Knuth-Morris-Pratt Algorithm: An Analysis
Sort
View
FOCM
2006
97views more  FOCM 2006»
15 years 6 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
IJON
2008
158views more  IJON 2008»
15 years 6 months ago
An adaptive stereo basis method for convolutive blind audio source separation
We consider the problem of convolutive blind source separation of stereo mixtures. This is often tackled using frequency-domain independent component analysis (FDICA), or time-fre...
Maria G. Jafari, Emmanuel Vincent, Samer A. Abdall...
IGPL
2006
87views more  IGPL 2006»
15 years 6 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
Eli Shamir
CORR
2007
Springer
127views Education» more  CORR 2007»
15 years 6 months ago
Attribute Exploration of Discrete Temporal Transitions
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
Johannes Wollbold
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
« Prev « First page 2228 / 2453 Last » Next »