Sciweavers

15033 search results - page 72 / 3007
» Complexity Theory and Algorithms
Sort
View
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 26 days ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
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...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
TNN
2010
234views Management» more  TNN 2010»
15 years 1 months ago
Novel maximum-margin training algorithms for supervised neural networks
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...
Oswaldo Ludwig, Urbano Nunes