L'édition de cet ISBN n'est malheureusement plus disponible.
Afficher les exemplaires de cette édition ISBN
Frais de port :
Gratuit
Vers Etats-Unis
Description du livre Soft Cover. Etat : new. N° de réf. du vendeur 9789811539305
Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9789811539305_lsuk
Description du livre Etat : New. N° de réf. du vendeur 43437404-n
Description du livre Etat : New. Book is in NEW condition. 0.68. N° de réf. du vendeur 9811539308-2-1
Description du livre Etat : New. New! This book is in the same immaculate condition as when it was published 0.68. N° de réf. du vendeur 353-9811539308-new
Description du livre Etat : New. N° de réf. du vendeur 43437404-n
Description du livre Etat : New. N° de réf. du vendeur ABLIING23Apr0412070088834
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9789811539305
Description du livre Etat : 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. N° de réf. du vendeur 477964087
Description du livre Taschenbuch. Etat : 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. N° de réf. du vendeur 9789811539305