Sciweavers

SIAMSC
2008
193views more  SIAMSC 2008»
13 years 4 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
ICANN
2009
Springer
13 years 9 months ago
Scalable Neural Networks for Board Games
Learning to solve small instances of a problem should help in solving large instances. Unfortunately, most neural network architectures do not exhibit this form of scalability. Our...
Tom Schaul, Jürgen Schmidhuber