0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint) - Couverture souple

Papatheodoro, T. S.

9781334216763: 0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar Disc (Classic Reprint)

Couverture souple

ISBN 10 : 1334216762 ISBN 13 : 9781334216763

Editeur : Forgotten Books, 2018

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

4 Neuf

De EUR 14,98

This book focuses on a set of parallel algorithms which serve to address the intersection or union queries of many planar discs in a given plane. The algorithms within are designed for a parallel computation and feature reduced time complexities making them an efficient choice for processing large datasets. The efficient use of computer resources and the unique characterisation of the boundaries makes this book stand out as an authoritative guide on the subject matter.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Forgotten Books
Date d'�dition: 2018
Langue: anglais
ISBN 10: 1334216762
ISBN 13: 9781334216763
Reliure: Broch�
Nombre de pages: 27
Coordonn�es du fabricant: Copytech (UK) Ltd, Trading as Printondemand-worldwide.com
gpsr@podww.com

9 Culley Court
Orton Southgate
Peterborough
Cambridgeshire
PE2 6WA
Royaume-Uni
Personne responsable: Easy Access System Europe O�, 16879218
+358405003575
gpsr.requests@easproject.com

Mustam�e tee 50
Tallinn
10621
Estonie

R�sultats de recherche pour 0 (Logn) Parallel Time Intersection and Union Algorithms...

Image fournie par le vendeur

0 (Logn) Parallel Time Intersection and Union Algorithms for a Set of Planar

T. S. Papatheodoro, P. G. Spirakis

Edit� par Forgotten Books

ISBN 10 : 1334216762 ISBN 13 : 9781334216763

Neuf Paperback

impression � la demande

Vendeur : Forgotten Books, London, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : New. Print on Demand. This book focuses on a set of parallel algorithms which serve to address the intersection or union queries of many planar discs in a given plane. The algorithms within are designed for a parallel computation and feature reduced time complexities making them an efficient choice for processing large datasets. The efficient use of computer resources and the unique characterisation of the boundaries makes this book stand out as an authoritative guide on the subject matter. 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 9781334216763_0

Contacter le vendeur