Using Additional Information in Streaming Algorithms - Raffael Buff
-20% with code BOOKS
Shipping in 12-18 days
30-day return policy
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 ... Full description
You May Also Like
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-20% with code BOOKS
In stock at our supplier
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-20% with code BOOKS
In stock at our supplier
TOP
Automate the Boring Stuff with Python
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Hacking: The Art of Exploitation
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville
-20% with code BOOKS
In stock at our supplier
TOP
Computer Systems: A Programmer's Perspective, Global Edition
David R. O'Hallaron, Randal E. Bryant
-20% with code BOOKS
In stock at our supplier
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Author | Raffael Buff |
|---|---|
| Publisher | Anchor Academic Publishing |
| Release year | 2016 |
| Cover type | Softcover |
| EAN | 9783960670940 |