Sciweavers

2095 search results - page 288 / 419
» Improved pebbling bounds
Sort
View
DSN
2008
IEEE
14 years 4 months ago
Enhancing data availability in disk drives through background activities
Latent sector errors in disk drives affect only a few data sectors. They occur silently and are detected only when the affected area is accessed again. If a latent error is detect...
Ningfang Mi, Alma Riska, Evgenia Smirni, Erik Ried...
MOBICOM
2004
ACM
14 years 3 months ago
Exploiting medium access diversity in rate adaptive wireless LANs
Recent years have seen the growing popularity of multi-rate wireless network devices (e.g., 802.11a cards) that can exploit variations in channel conditions and improve overall ne...
Zhengrong Ji, Yi Yang, Junlan Zhou, Mineo Takai, R...
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
ECCC
2010
143views more  ECCC 2010»
13 years 7 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
DAC
2006
ACM
14 years 11 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...