Advances in Applied and Computational Topology(English, Hardcover, unknown)

Advances in Applied and Computational Topology(English, Hardcover, unknown)

  • unknown
Publisher:American Mathematical Soc.ISBN 13: 9780821853276ISBN 10: 0821853279

Paperback & Hardcover deals ―

Amazon IndiaGOFlipkart ₹ 2602SnapdealGOSapnaOnlineGOJain Book AgencyGOBooks Wagon₹4,017Book ChorGOCrosswordGODC BooksGO

e-book & Audiobook deals ―

Amazon India GOGoogle Play Books ₹64Audible GO

* Price may vary from time to time.

* GO = We're not able to fetch the price (please check manually visiting the website).

Know about the book -

Advances in Applied and Computational Topology(English, Hardcover, unknown) is written by unknown and published by American Mathematical Society. It's available with International Standard Book Number or ISBN identification 0821853279 (ISBN 10) and 9780821853276 (ISBN 13).

What is the shape of data? How do we describe flows? Can we count by integrating? How do we plan with uncertainty? What is the most compact representation? These questions, while unrelated, become similar when recast into a computational setting. Our input is a set of finite, discrete, noisy samples that describes an abstract space. Our goal is to compute qualitative features of the unknown space. It turns out that topology is sufficiently tolerant to provide us with robust tools. This volume is based on lectures delivered at the 2011 AMS Short Course on Computational Topology, held January 4-5, 2011 in New Orleans, Louisiana. The aim of the volume is to provide a broad introduction to recent techniques from applied and computational topology. Afra Zomorodian focuses on topological data analysis via efficient construction of combinatorial structures and recent theories of persistence. Marian Mrozek analyzes asymptotic behavior of dynamical systems via efficient computation of cubical homology. Justin Curry, Robert Ghrist, and Michael Robinson present Euler Calculus, an integral calculus based on the Euler characteristic, and apply it to sensor and network data aggregation. Michael Erdmann explores the relationship of topology, planning, and probability with the strategy complex. Jeff Erickson surveys algorithms and hardness results for topological optimization problems.