Sciweavers

11394 search results - page 434 / 2279
» Error-Correcting Data Structures
Sort
View
IPPS
1996
IEEE
15 years 9 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
191
Voted
CGF
2010
181views more  CGF 2010»
15 years 4 months ago
Matrix Trees
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
Nathan Andrysco, Xavier Tricoche
143
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
Building Scalable Virtual Routers with Trie Braiding
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...
277
Voted
IV
2007
IEEE
366views Visualization» more  IV 2007»
15 years 11 months ago
Algorithm Visualization in Teaching Spatial Data Algorithms
Algorithm visualization is a widely–used tool for teaching data structures and algorithms. Spatial data algorithms are algorithms that are designed to process multidimensional d...
Jussi Nikander, Juha Helminen
158
Voted
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
15 years 8 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren