8298 search results - page 217 / 1660 » On the Complexity of Numerical Analysis |
203
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
194
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
291
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
211
click to vote
TNN
2011
15 years 2 months ago
2011
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
315
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...