Sciweavers

1945 search results - page 216 / 389
» Speeding up Serpent
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
Fast Hierarchical Clustering Based on Compressed Data
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
Erendira Rendon, Ricardo Barandela
EDBT
2010
ACM
206views Database» more  EDBT 2010»
16 years 1 months ago
Efficient computation of trade-off skylines
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
Christoph Lofi, Ulrich Güntzer, Wolf-Tilo Bal...
RTSS
2006
IEEE
16 years 14 days ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller
CODES
2005
IEEE
16 years 3 days ago
Aggregating processor free time for energy reduction
Even after carefully tuning the memory characteristics to the application properties and the processor speed, during the execution of real applications there are times when the pr...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
CRYPTO
2004
Springer
128views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Faster Correlation Attack on Bluetooth Keystream Generator E0
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
Yi Lu 0002, Serge Vaudenay