Sciweavers

559 search results - page 12 / 112
» Algorithms and Data Structures for External Memory
Sort
View
IPL
2002
59views more  IPL 2002»
14 years 9 months ago
An efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular...
Rezaul Alam Chowdhury, M. Kaykobad, Irwin King
WSCG
2004
197views more  WSCG 2004»
14 years 10 months ago
Collision Prediction Using MKtrees
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
Marta Franquesa-Niubó, Pere Brunet
IPPS
2002
IEEE
15 years 2 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
VLSID
2000
IEEE
94views VLSI» more  VLSID 2000»
15 years 1 months ago
A Genetic Algorithm for the Synthesis of Structured Data Paths
The technique presented here achieves simultaneous optimization of schedule time and data path component cost within a structured data path architecture, using a genetic algorithm...
Chittaranjan A. Mandal, R. M. Zimmer
PPOPP
2011
ACM
14 years 9 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...