LIBRISTO
LIBROAMANTO
mandatory
Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free
0
DPD courier 4.99 GLS courier 9.99

Algorithms for Sparsity-Constrained Optimization

Language EnglishEnglish
Book Hardback
Book Algorithms for Sparsity-Constrained Optimization Sohail Bahmani
Libristo code: 02006184
Publishers Springer International Publishing AG, October 2013
This thesis presents a wholly new technique in the structural analysis of data that uses a greedy al... Full description
? points 373 b
154.26
In stock at our supplier Shipping in 10-13 days

Up to 30 days for returns


Customers also purchased


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.§

Actress & Polyglot
EWA KASP for
Play video
Ewa Kasp
Libristo has the largest selection of foreign-language books. That’s why I buy my books there.
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's address

You might also be interested in


Practical Aspects of Declarative Languages Enrico Pontelli / Book Paperback
common.buy 51.65
Bewilderment - A Novel POWERS RICHARD / Book Paperback
common.buy 9.90
Our Next-Door Neighbors (1917) Belle Kanaris Maniates / Book Paperback
common.buy 30.72
Nature Ralph Waldo Emerson / Book Paperback
common.buy 10.60
Light Complicite / Book Paperback
common.buy 16.27
Bioseparation G.T. Tsao / Book Paperback
common.buy 51.65

Login

Log in to your account. Don't have a Libristo account? Create one now!

 
mandatory
mandatory

Don’t have an account? Discover the benefits of having a Libristo account!

With a Libristo account, you'll have everything under control.

Create a Libristo account
Book advisor Libroamiko
Hi, I'm Libroamiko, can I help?