2020 search results - page 177 / 404 » Speeding up Slicing |
160
click to vote
CJ
2002
15 years 6 months ago
2002
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
166
click to vote
NJC
2000
15 years 6 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
176
click to vote
ISCI
1998
15 years 5 months ago
1998
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
139
click to vote
TCSV
2002
15 years 5 months ago
2002
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
200
click to vote
TIP
2002
15 years 5 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...