Algorithms for Sparsity-Constrained Optimization
11
%
2671 Kč 2 994 Kč
Sleva až 70% u třetiny knih
This thesis presents a wholly new technique in the structural analysis of data that uses a `greedy' algorithm to derive optimal sparse solutions, enabling faster and more accurate results in formerly problematic areas of machine learning and signal processing.
| Autor: | Bahmani, Sohail |
| Nakladatel: | Springer International Publishing AG |
| ISBN: | 9783319018805 |
| Rok vydání: | 2013 |
| Jazyk : | Angličtina |
| Vazba: | Hardback |
| Počet stran: | 107 |
Mohlo by se vám také líbit..
-
Lie Groups, Lie Algebras, and Repres...
Hall, Brian J
-
Theory and Simulation of Random Phen...
Vitali, Ettore; Motta, Mario; Galli, Davide Emilio
-
Time Series Analysis and Its Applica...
Shumway, Robert H.; Stoffer, David S.
-
Homotopical Topology
Fomenko, Anatoly; Fuchs, Dmitry
-
Dirichlet Forms Methods for Poisson ...
Bouleau, Nicolas; Denis, Laurent
-
Don Pigozzi on Abstract Algebraic Lo...
-
Markov Chains
Moulines, Eric; Stoffer, David S.; Douc, Randal
-
A Brief Introduction to Berezin-Toepl...
Le Floch, Yohann
-
Galois Theory Through Exercises
Brzezinski, Juliusz
-
Differential Equations
Constanda, Christian
-
Non-Newtonian Fluid Mechanics and Co...
Farina, Angiolo; Mikelic, Andro; Saccomandi, Giuseppe; Sequeira, Adelia; Toro, Eleuterio F.
-
Computational Physics
Scherer, Philipp
-
Complex Analysis with Applications
Goldstein, Larry J.; Schneider, David I.; Lay, David C.; Asmar, Nakhle H.
-
Lectures on Matrix Field Theory
Ydri, Badis
-
One-Dimensional Finite Elements
Öchsner, Andreas
-
The Spectrum of Hyperbolic Surfaces
Bergeron, Nicolas