2957 search results - page 344 / 592 » The Complexity of Polynomial-Time Approximation |
186
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
216
click to vote
ML
2012
ACM
14 years 2 months ago
2012
ACM
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
214
click to vote
AAAI
2012
13 years 9 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
161
click to vote
MICCAI
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. We present a novel technique where a medical image segmentation system is evolved using genetic programming. The evolved system was trained on just 8 images outlined by a...
154
click to vote
ICCSA
2010
Springer
16 years 1 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...