3825 search results - page 206 / 765 » More on pooling spaces |
193
click to vote
EH
1999
IEEE
15 years 10 months ago
1999
IEEE
An evolutionary algorithm is used to evolve a digital circuit which computes a simple hash function mapping a 16bit address space into an 8-bit one. The target technology is FPGA,...
180
click to vote
ADBIS
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we propose and analyze a new spatial access method, namely the S∗ -tree, for the efficient secondary memory encoding and manipulation of images containing multiple ...
169
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
168
click to vote
ADBIS
1998
Springer
15 years 10 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
166
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
A model for virtual memory in a distributed memory parallel computer is proposed. It uses a novel parallel computing operating system framework and leads to the definition of two ...