15033 search results - page 72 / 3007 » Complexity Theory and Algorithms |
191
click to vote
APPROX
2009
Springer
16 years 1 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...
269
click to vote
TNN
2010
15 years 2 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...
163
Voted
ASIAN
2007
Springer
15 years 11 months ago
2007
Springer
