Greedy Approximation.
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances.
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2011.
|
| Subjects: | |
| Online Access: |
Full text (MFA users only) |
| ISBN: | 9781139159326 1139159321 1107003377 9781107003378 9780511762291 0511762291 9781139161374 1139161377 9781139157551 1139157558 |
| Local Note: | ProQuest Ebook Central |
| Summary: | Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances. |
|---|---|
| Item Description: | 4.6 Application of greedy algorithms in learning theory. |
| Physical Description: | 1 online resource (434 pages) |
| Bibliography: | Includes bibliographical references and index. |
| Series: | Cambridge monographs on applied and computational mathematics.
|
| Library Staff: | View instance in FOLIO |