Del 261 - Springer Theses
Algorithms for Sparsity-Constrained Optimization
Häftad, Engelska, 2016
2 109 kr
Beställningsvara. Skickas inom 10-15 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.Finns i fler format (1)
This thesis demonstrates techniques that provide faster and more accurate solutions to a variety of problems in machine learning and signal processing. The author proposes a "greedy" algorithm, deriving sparse solutions with guarantees of optimality. The use of this algorithm removes many of the inaccuracies that occurred with the use of previous models.
Produktinformation
- Utgivningsdatum2016-08-23
- Mått155 x 235 x 8 mm
- Vikt213 g
- FormatHäftad
- SpråkEngelska
- SerieSpringer Theses
- Antal sidor107
- FörlagSpringer International Publishing AG
- ISBN9783319377193