2157 search results - page 34 / 432 » Optimal Fast Hashing |
105
click to vote
CGF
2008
15 years 3 months ago
2008
This work emerged from the following observation: usual search procedures for octrees start from the root to retrieve the data stored at the leaves. But since the leaves are the fa...
150
click to vote
COMGEO
2000
ACM
15 years 2 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
116
click to vote
TOIS
2002
15 years 2 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
191
click to vote
CRYPTO
1999
Springer
15 years 7 months ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
161
click to vote
DAMON
2008
Springer
15 years 4 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...