Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 59,52
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 59,51
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 66,02
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Revaluation Books, Exeter, Regno Unito
EUR 77,79
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 2014 edition. 150 pages. 9.25x6.10x0.50 inches. In Stock.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios. 132 pp. Englisch.
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents new results to improve data compression by solving optimization problemsPresents efficient solutions to pattern matching problems in compressed spaceNice balance of theoretical achievements and algorithm-engineering results for com.
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 53,49
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 132 pp. Englisch.
Da: preigu, Osnabrück, Germania
EUR 50,25
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Compressed Data Structures for Strings | On Searching and Extracting Strings from Compressed Textual Data | Rossano Venturini | Buch | Atlantis Studies in Computing | xiv | Englisch | 2013 | Atlantis Press | EAN 9789462390324 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 58,39
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce solutions that overcome this dichotomy. We start by presenting the use of optimization techniques to improve the compression of classical data compression algorithms, then we move to the design of compressed data structures providing fast random access or efficient pattern matching queries on the compressed dataset. These theoretical studies are supported by experimental evidences of their impact in practical scenarios.