Partially Ordered Search Indices in the Organizationof a Fixed Hierarchy

Simple item page
dc.contributor.authorSkyttä, Jormaen_US
dc.contributor.authorTakala, Tapioen_US
dc.contributor.editorFons Kuijk and Wolfgang Strasseren_US
dc.date.accessioned2014-02-06T14:01:45Z
dc.date.available2014-02-06T14:01:45Z
dc.date.issued1987en_US
dc.description.abstract"IntroductionThe mapping of even very advanced algorithms directly to hardware does not typically bring good results as these algorithms are originally designed for sequential processing. However, the power of the modern integration technology lies in its ability to produce high volumes of reasonably complex elements at moderate cost. For utilization of these possibilities the algorithms and data structures already developed must be redesigned for parallel computation."en_US
dc.description.seriesinformationEurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn3-540-50109-6en_US
dc.identifier.issn1727-3471en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH87/039-046en_US
dc.publisherThe Eurographics Associationen_US
dc.titlePartially Ordered Search Indices in the Organizationof a Fixed Hierarchyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
039-046.pdf
Size:
419.19 KB
Format:
Adobe Portable Document Format
Download
Collections
EGGH87: Eurographics Workshop on Graphics Hardware 1987