LIBRISTO
LIBROAMANTO
obvezno
Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun
0
Brezplačna dostava Zásilkovna nad 69.99 €
Zbirna točka GLS 4.99 € Zbirna točka DPD 3.49 € Kurirska služba GLS 5.99 € Kurir DPD 3.99 € Kurirska služba Express One 3.99 € Zbirno mesto Express One 3.99 € Zbirno mesto Pošte Slovenije 3.99 € Dostava preko Pošte Slovenije 3.99 €

Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Using Additional Information in Streaming Algorithms

Jezik AngleščinaAngleščina
Knjiga Mehka
Knjiga Using Additional Information in Streaming Algorithms Raffael Buff
Koda Libristo: 15223817
Založba Diplom.de, oktober 2016
Streaming problems are algorithmic problems that are mainly characterized by their massive input str... Celoten opis
? points 81 b
33.34 €
Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

Do 30 dni za vračilo


Drugi so kupili tudi


L'avenir est en NOUS ! Mermet / Knjiga Mehka
common.buy 17.62 €
Historia De La Alianza Celeste Roldan / E-knjiga Adobe ePub DRM
common.buy 4.60 €
El síndrome de la impostora ELISABETH CADOCHE Y ANNE DE MONTARLOT / Knjiga Mehka
common.buy 8.40 €
La pura verdad DAN GEMEINHART / Knjiga Mehka
common.buy 18.22 €
Dictionnaire didactique de la langue française Michel Pougeoise / Knjiga Knjiga
common.buy 56.97 €
IV Faust / Zvok Zvočni CD
common.buy 15.81 €
Apprivoiser le crabe MATALON Knjiga Mehka
common.buy 18.32 €
TAI-JITSU SELF-DEFENSE BUDO EDITIONS Film DVD
common.buy 18.82 €
Till der Goldfisch / Knjiga Mehka
common.buy 16.11 €
Top
Neked megfelel? gazdagság (Hungarian) Gary M. Douglas / Knjiga Mehka
common.buy 15.01 €
Wozu wollen Sie das wissen? Alice Munro / Knjiga Trda
common.buy 8.50 €
Unser Traumhund Constantin Ridders / Knjiga Mehka
common.buy 20.82 €
Paracord-Basics J. D. Lenzen / Knjiga Mehka
common.buy 11.91 €

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. In this thesis, the two streaming problems most frequent item and number of distinct items are studied in detail relating to their algorithmic complexities, and it is compared whether the verification of solution hypotheses has lower algorithmic complexity than computing a solution from the data stream. For this analysis, we introduce some concepts to prove space complexity lower bounds for an approximative setting and for hypothesis verification. For the most frequent item problem which consists in identifying the item which has the highest occurrence within the data stream, we can prove a linear space complexity lower bound for the deterministic and probabilistic setting. This implies that, in practice, this streaming problem cannot be solved in a satisfactory way since every algorithm has to exceed any reasonable storage limit. For some settings, the upper and lower bounds are almost tight, which implies that we have designed an almost optimal algorithm. Even for small approximation ratios, we can prove a linear lower bound, but not for larger ones. Nevertheless, we are not able to design an algorithm that solves the most frequent item problem space-efficiently for large approximation ratios. Furthermore, if we want to verify whether a hypothesis of the highest frequency count is true or not, we get exactly the same space complexity lower bounds, which leads to the conclusion that we are likely not able to profit from a stated hypothesis. The number of distinct items problem counts all different elements of the input stream. If we want to solve this problem exactly (in a deterministic or probabilistic setting) or approximately with a deterministic algorithm, we require once again linear storage size which is tight to the upper bound. However, for the approximative and probabilistic setting, we can enhance an already known space-efficient algorithm such that it is usable for arbitrarily small approximation ratios and arbitrarily good success probabilities. The hypothesis verification leads once again to the same lower bounds. However, there are some streaming problems that are able to profit from additional information such as hypotheses, as e.g., the median problem.

Igralka & Poliglotka
EWA KASP za
Predvajaj video
Ewa Kasp
Libristo ima največjo izbiro tujejezične literature. Zato svoje knjige kupujem tukaj.

O knjigi

Polni naslov Using Additional Information in Streaming Algorithms
Avtor Raffael Buff
Jezik Angleščina
Vezava Knjiga - Mehka
Datum izida 2016
Število strani 132
EAN 9783961165421
ISBN 3961165424
Koda Libristo 15223817
Založba Diplom.de
Teža 181
Mere 148 x 210 x 8
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovanca

Morda bi vas zanimalo tudi


Advanced Concepts of Crystal Structures Rupert Preston / Knjiga Trda
common.buy 118.36 €
Top
A Brief History Of Time Stephen Hawking / Knjiga Mehka
common.buy 9.90 €
Optimization of Logistics Turkay Yildiz / Knjiga Mehka
common.buy 50.46 €
Twenty-six Italian Songs and Arias John Glenn Paton / Knjiga Mehka
common.buy 15.81 €
The Royal We Heather Cocks / Knjiga Trda
common.buy 34.04 €
General Psychological Theory Sigmund Freud / Knjiga Mehka
common.buy 14.91 €
System of Christian Doctrine, Volume 3 Isaak A. Dorner / Knjiga Mehka
common.buy 29.03 €
When Did It Aal Gan Wrang Alan Baker / Knjiga Mehka
common.buy 8.80 €
10 Best Ways to Burn Belly Fat Terry Clark / Knjiga Mehka
common.buy 18.62 €
Ethna, or, Etchings in black and white Stuart Laidlaw / Knjiga Mehka
common.buy 21.62 €
Top
Hunter X Hunter 9 Yoshihiro Togashi / Knjiga Mehka
common.buy 9.00 €
Mountain Lions Betsy Rathburn / Knjiga Trda
common.buy 32.34 €
History of Russia in 50 Events Stephan Weaver / Knjiga Mehka
common.buy 12.51 €
Warmongers Sean Michael O'Dea / Knjiga Mehka
common.buy 12.51 €
Blue Guide Lee Briccetti / Knjiga Mehka
common.buy 12.31 €
Of Holy Virginity St Augustine / Knjiga Mehka
common.buy 7.30 €

Prijava

Prijavite se v svoj račun. Še nimate računa Libristo? Ustvarite ga zdaj!

 
obvezno
obvezno

Še nimate računa? Izkoristite prednosti računa Libristo!

Z računom Libristo boste imeli vedno vse pod nadzorom.

Ustvarite račun Libristo
Knjižni svetovalec Libroamiko
Pozdravljeni, sem Libroamiko, vam lahko pomagam?