Mustafa offers a thorough account of probabilistic, combinatorial, and geometric sampling methods and their combinatorial and algorithmic applications. He also revisits classical results but with new and more elegant proofs. Readers need a basic familiarity with discrete mathematics, probability, and combinatorics to understand the material, he says. The book can serve as a textbook for a graduate course or a reference for researchers. His topics include refining random samples, epsilon-nets: combinatorial bounds, epsilon-approximations: first bounds, and epsilon-approximations: functional cases. Annotation ©2022 Ringgold, Inc., Portland, OR (protoview.com)
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26395321571
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Codice articolo 401055548
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 44201728-n
Quantità: 3 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 2022. Paperback. . . . . . Codice articolo V9781470461560
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. Codice articolo 18395321577
Quantità: 1 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Paperback. Condizione: New. Understanding the behavior of basic sampling techniques and intrinsic geometric attributes of data is an invaluable skill that is in high demand for both graduate students and researchers in mathematics, machine learning, and theoretical computer science. The last ten years have seen significant progress in this area, with many open problems having been resolved during this time. These include optimal lower bounds for epsilon-nets for many geometric set systems, the use of shallow-cell complexity to unify proofs, simpler and more efficient algorithms, and the use of epsilon-approximations for construction of coresets, to name a few. This book presents a thorough treatment of these probabilistic, combinatorial, and geometric methods, as well as their combinatorial and algorithmic applications. It also revisits classical results, but with new and more elegant proofs. While mathematical maturity will certainly help in appreciating the ideas presented here, only a basic familiarity with discrete mathematics, probability, and combinatorics is required to understand the material. Codice articolo LU-9781470461560
Quantità: 2 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 251 pages. 9.75x7.00x0.75 inches. In Stock. Codice articolo __1470461560
Quantità: 2 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 44201728-n
Quantità: 3 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9781470461560
Quantità: 3 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 44201728
Quantità: 3 disponibili