Sciweavers

1945 search results - page 131 / 389
» Speeding up Serpent
Sort
View
DAWAK
2005
Springer
15 years 12 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
FOCS
2003
IEEE
15 years 11 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
IPPS
2002
IEEE
15 years 11 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
CIKM
2009
Springer
15 years 11 months ago
RS-Wrapper: random write optimization for solid state drive
Solid State Drive (SSD), emerging as new data storage media with high random read speed, has been widely used in laptops, desktops, and data servers to replace hard disk during th...
Da Zhou, Xiaofeng Meng
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
15 years 10 months ago
UMAC: Fast and Secure Message Authentication
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...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...