Articles liés à Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Cascading Divide-and-Conquer (Classic Reprint): A Technique for Designing Parallel Algorithms - Couverture souple
Synopsis
Excerpt from Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Visibility from a Point: Given n line segments such that no two intersect (except possibly at endpoints) and a point p, determine that part of the plane visible from p if all the segments are opaque. A (log nlog log n,u) solution was given in We improve this to (log n,u).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 18,92
EUR 1,06 expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Image d'archives
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332870325
Quantité disponible : 15 disponible(s)
Image d'archives
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332870325
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book presents a powerful technique called cascading divide-and-conquer, a set of efficient algorithms for solving geometric problems in parallel. It improves on existing methods by offering reduced time complexity for a wide range of problems, including segment intersection detection, trapezoidal decomposition, and planar point location. The book also introduces new techniques: fractional cascading, and plane sweep tree construction. It shows how to apply cascading divide-and-conquer to solve the challenging 3D maxima, 2-set dominance counting, and visibility from a point problems. All of the algorithms presented run in O (log n) time with either linear or sub-linear processors in the CREW PRAM model. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781332870325_0
Quantité disponible : Plus de 20 disponibles
Image d'archives
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
impression à la demandeVendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 52 pages. 8.82x5.75x0.16 inches. This item is printed on demand. N° de réf. du vendeur zk1332870325
Quantité disponible : 1 disponible(s)