Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 154,54
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 147,56
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Condizione: New. 1st ed. 2020 edition NO-PA16APR2015-KAP.
Da: Majestic Books, Hounslow, Regno Unito
EUR 170,98
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 190,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 194,09
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 165,03
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently. More concretely, it proposes a workload-aware cost model to guide the development of high-performance algorithms. On the basis of the cost model, the book subsequently presents a system-level optimization resulting in a partition-aware graph-computing engine, PAGE. In addition, it presents three efficient and scalable advanced graph algorithms - the subgraph enumeration, cohesive subgraph detection, and graph extraction algorithms.This book offers a valuable reference guide for junior researchers, covering the latest advances in large-scale graph analysis; and for senior researchers, sharing state-of-the-art solutions based on advanced graph algorithms. In addition, all readers will find a workload-aware methodology fordesigning efficient large-scale graph algorithms.
Lingua: Inglese
Editore: Springer Nature Singapore, Springer Nature Singapore Jul 2021, 2021
ISBN 10: 9811539308 ISBN 13: 9789811539305
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 160,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Neuware -This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently. More concretely, it proposes a workload-aware cost model to guide the development of high-performance algorithms. On the basis of the cost model, the book subsequently presents a system-level optimization resulting in a partition-aware graph-computing engine, PAGE. In addition, it presents three efficient and scalable advanced graph algorithms ¿ the subgraph enumeration, cohesive subgraph detection, and graph extraction algorithms.This book offers a valuable reference guide for junior researchers, covering the latest advances in large-scale graph analysis; and for senior researchers, sharing state-of-the-art solutions based on advanced graph algorithms. In addition, all readers will find a workload-aware methodology fordesigning efficient large-scale graph algorithms.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 160 pp. Englisch.
Lingua: Inglese
Editore: Springer-Nature New York Inc, 2021
ISBN 10: 9811539308 ISBN 13: 9789811539305
Da: Revaluation Books, Exeter, Regno Unito
EUR 225,62
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 159 pages. 9.25x6.10x0.35 inches. In Stock.
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Springer Nature Singapore Jul 2021, 2021
ISBN 10: 9811539308 ISBN 13: 9789811539305
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 160,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently. More concretely, it proposes a workload-aware cost model to guide the development of high-performance algorithms. On the basis of the cost model, the book subsequently presents a system-level optimization resulting in a partition-aware graph-computing engine, PAGE. In addition, it presents three efficient and scalable advanced graph algorithms - the subgraph enumeration, cohesive subgraph detection, and graph extraction algorithms.This book offers a valuable reference guide for junior researchers, covering the latest advances in large-scale graph analysis; and for senior researchers, sharing state-of-the-art solutions based on advanced graph algorithms. In addition, all readers will find a workload-aware methodology fordesigning efficient large-scale graph algorithms. 160 pp. Englisch.
Lingua: Inglese
Editore: Springer, Berlin|Springer Nature Singapore|National Natural Science Foundation of China|Springer, 2021
ISBN 10: 9811539308 ISBN 13: 9789811539305
Da: moluna, Greven, Germania
EUR 136,16
Quantità: Più di 20 disponibili
Aggiungi al carrelloKartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book introduces readers to a workload-aware methodology for large-scale graph algorithm optimization in graph-computing systems, and proposes several optimization techniques that can enable these systems to handle advanced graph algorithms efficiently.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 196,36
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.