Using Additional Information in Streaming Algorithms - Raffael Buff
-30% ar kodu BOOKS
Piegāde 12-18 darba dienu laikā
30 dienu atgriešanas politika
Streaming problems are algorithmic problems that are mainly characterized by their massive input streams. Because of these data streams, the algorithms for these problems are forced to be space-efficient, as the input stream length generally exceeds the available storage. The goal of this study is to analyze the impact of additional information (more specifically, a hypothesis of the solution) on the algori ... Pilns apraksts
Jums varētu patikt arī
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
HBR Guide to Generative AI for Managers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-30% ar kodu BOOKS
Nav noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
Streaming problems are algorithmic problems that are mainly characterized by their massive input streams. Because of these data streams, the algorithms for these problems are forced to be space-efficient, as the input stream length generally exceeds the available storage. The goal of this study is to analyze the impact of additional information (more specifically, a hypothesis of the solution) on the algorithmic space complexities of several streaming problems. To this end, different streaming problems are analyzed and compared. The two problems ¿most frequent item¿ and ¿number of distinct items¿, with many configurations of different result accuracies and probabilities, are deeply studied. Both lower and upper bounds for the space and time complexity for deterministic and probabilistic environments are analyzed with respect to possible improvements due to additional information. The general solution search problem is compared to the decision problem where a solution hypothesis has to be satisfied.
Vairāk informācijas
| Autors | Raffael Buff |
|---|---|
| Izdevējs | Anchor Academic Publishing |
| Izlaides gads | 2016 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783960670940 |