Sciweavers

559 search results - page 74 / 112
» Algorithms and Data Structures for External Memory
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 6 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CAD
2004
Springer
15 years 2 months ago
A multi-resolution topological representation for non-manifold meshes
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...
Leila De Floriani, Paola Magillo, Enrico Puppo, Da...
CODES
2007
IEEE
15 years 8 months ago
Compile-time decided instruction cache locking using worst-case execution paths
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access results in a definite cache hit or miss. This unpredictability i...
Heiko Falk, Sascha Plazar, Henrik Theiling
112
Voted
SAC
2010
ACM
15 years 9 months ago
Infrastructureless storage in dynamic environments
This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and...
Jose Luis Fernandez-Marquez, Josep Lluís Ar...
146
Voted
EUROPAR
2000
Springer
15 years 6 months ago
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
David S. Wise