15033 search results - page 72 / 3007 » Complexity Theory and Algorithms |
116
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
177
click to vote
TNN
2010
14 years 10 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
96
Voted
AAECC
2007
Springer
15 years 9 months ago
2007
Springer
115
Voted
COCO
2000
Springer
15 years 8 months ago
2000
Springer
114
Voted
ASIAN
2007
Springer
15 years 7 months ago
2007
Springer