Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Using Additional Information in Streaming Algorithms
Engleski
86 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
14.86
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
30.55
€
/
Meki uvez
12.43
€
/
Meki uvez
15.77
€
/
Tvrdi uvez
55.84
€
/
Tvrdi uvez
43.90
€
