Sciweavers

6756 search results - page 1174 / 1352
» The Structure of Visual Spaces
Sort
View
SC
1993
ACM
15 years 10 months ago
Solving the Boltzmann equation at 61 gigaflops on a 1024-node CM-5
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
Lyle N. Long, Jacek Myczkowski
WG
1993
Springer
15 years 10 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
VLDB
1994
ACM
137views Database» more  VLDB 1994»
15 years 10 months ago
Performance of Data-Parallel Spatial Operations
The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R+-tree spatial data structures is compared...
Erik G. Hoel, Hanan Samet
VLDB
1994
ACM
129views Database» more  VLDB 1994»
15 years 10 months ago
Hilbert R-tree: An Improved R-tree using Fractals
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
Ibrahim Kamel, Christos Faloutsos
CAV
2010
Springer
172views Hardware» more  CAV 2010»
15 years 10 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
« Prev « First page 1174 / 1352 Last » Next »