Sciweavers

1541 search results - page 235 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 6 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
SOCIALCOM
2010
13 years 6 months ago
Estimating the Size of Online Social Networks
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Shaozhi Ye, Shyhtsun Felix Wu
WADS
2009
Springer
267views Algorithms» more  WADS 2009»
14 years 19 days ago
Computing the Implicit Voronoi Diagram in Triple Precision
In a paper that considered arithmetic precision as a limited resource in the design and analysis of algorithms, Liotta, Preparata and Tamassia defined an “implicit Voronoi diagr...
David L. Millman, Jack Snoeyink
ACNS
2004
Springer
85views Cryptology» more  ACNS 2004»
13 years 12 months ago
CamouflageFS: Increasing the Effective Key Length in Cryptographic Filesystems on the Cheap
One of the few quantitative metrics used to evaluate the security of a cryptographic file system is the key length of the encryption algorithm; larger key lengths correspond to hig...
Michael E. Locasto, Angelos D. Keromytis
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 8 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...