12257 search results - page 2200 / 2452 » Analysis of Algorithms |
130
Voted
IJON
2008
15 years 3 months ago
2008
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...
124
click to vote
IGPL
2006
15 years 3 months ago
2006
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...
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
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...
131
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— 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...
144
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...