Articoli correlati a Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Cascading Divide-and-Conquer (Classic Reprint): A Technique for Designing Parallel Algorithms: A Technique for Designing Parallel Algorithms (Classic Reprint) - Brossura
Sinossi
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).
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 15,48
GRATIS per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Cascading Divide-and-Conquer (Classic Reprint): A Technique...
Immagini fornite dal venditore
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781332870325_0
Quantità: Più di 20 disponibili
Foto dell'editore
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332870325
Quantità: 15 disponibili
Foto dell'editore
Cascading DivideandConquer Classic Reprint A Technique for Designing Parallel Algorithms
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332870325
Quantità: 15 disponibili
Foto dell'editore
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Classic Reprint)
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 52 pages. 8.82x5.75x0.16 inches. This item is printed on demand. Codice articolo zk1332870325
Quantità: 1 disponibili