Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Data Structures and Efficient Algorithms

Final Report on the DFG Special Joint Initiative
BuchKartoniert, Paperback
395 Seiten
Englisch
Springererschienen am20.05.1992
For a period of five years about a dozenprojects were funded with an emphasis on algorithms and datastructures for geometric problems, on the one hand, andparallel and distributed algorithms, on the other.mehr

Produkt

KlappentextFor a period of five years about a dozenprojects were funded with an emphasis on algorithms and datastructures for geometric problems, on the one hand, andparallel and distributed algorithms, on the other.
Details
ISBN/GTIN978-3-540-55488-2
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr1992
Erscheinungsdatum20.05.1992
ReiheLecture Notes in Computer Science
Seiten395 Seiten
SpracheEnglisch
Gewicht666 g
IllustrationenIX, 395 p.
Artikel-Nr.10744668

Inhalt/Kritik

Inhaltsverzeichnis
Resemblance and symmetries of geometric patterns.- Selected topics from computational geometry, data structures and motion planning.- Processing of hierarchically defined graphs and graph families.- The combination of spatial access methods and computational geometry in geographic database systems.- A flexible and extensible index manager for spatial database systems.- The performance of object decomposition techniques for spatial query processing.- Distributed image synthesis with breadth-first ray tracing and the ray-z-buffer.- Restricted orientation computational geometry.- Monotonous Bisector* Trees - a tool for efficient partitioning of complex scenes of geometric objects.- Learning convex sets under uniform distribution.- Spatial access structures for geometric databases.- On spanning trees with low crossing numbers.- High performance universal hashing, with applications to shared memory simulations.- Distributed game tree search on a massively parallel system.- Balanced strategies for routing on meshes.- Complexity of Boolean functions on PRAMs - Lower bound techniques.- Enumerative vs. genetic optimization two parallel algorithms for the bin packing problem.- Area efficient methods to increase the reliability of circuits.mehr

Schlagworte