Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Using Additional Information in Streaming Algorithms
Angličtina
228 b
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
14.07
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
31.99
€
/
Brožovaná
14.98
€
/
Pevná
55.89
€
/
Brožovaná
11.94
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?