Sciweavers

11212 search results - page 219 / 2243
» Semi-persistent Data Structures
Sort
View
IPPS
1996
IEEE
15 years 10 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
CGF
2010
181views more  CGF 2010»
15 years 5 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
INFOCOM
2010
IEEE
15 years 4 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...
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
15 years 10 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
ER
2008
Springer
107views Database» more  ER 2008»
15 years 8 months ago
A Conceptual Modeling Framework for Expressing Observational Data Semantics
Observational data (i.e., data that records observations and measurements) plays a key role in many scientific disciplines. Observational data, however, are typically structured an...
Shawn Bowers, Joshua S. Madin, Mark P. Schildhauer