Sciweavers

1538 search results - page 286 / 308
» Relative Randomness and Cardinality
Sort
View
USENIX
2007
15 years 4 months ago
DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch
Current disk prefetch policies in major operating systems track access patterns at the level of the file abstraction. While this is useful for exploiting application-level access...
Xiaoning Ding, Song Jiang, Feng Chen, Kei Davis, X...
121
Voted
ACISICIS
2008
IEEE
15 years 3 months ago
Efficient Projection for Compressed Sensing
Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced...
Vo Dinh Minh Nhat, Duc Vo, Subhash Challa, Sungyou...
ISSTA
2010
ACM
15 years 3 months ago
Perturbing numerical calculations for statistical analysis of floating-point program (in)stability
Writing reliable software is difficult. It becomes even more difficult when writing scientific software involving floating-point numbers. Computers provide numbers with limite...
Enyi Tang, Earl T. Barr, Xuandong Li, Zhendong Su
COLT
2008
Springer
15 years 3 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak