Sciweavers

1567 search results - page 289 / 314
» Compressing Relations and Indexes
Sort
View
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
13 years 1 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
HPCA
2012
IEEE
12 years 5 months ago
Improving write operations in MLC phase change memory
Phase change memory (PCM) recently has emerged as a promising technology to meet the fast growing demand for large capacity memory in modern computer systems. In particular, multi...
Lei Jiang, Bo Zhao, Youtao Zhang, Jun Yang 0002, B...
PPOPP
2012
ACM
12 years 5 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
TVCG
2012
215views Hardware» more  TVCG 2012»
12 years 14 days ago
Geometric Calibration of Head-Mounted Displays and its Effects on Distance Estimation
Abstract—Head-mounted displays (HMDs) allow users to observe virtual environments (VEs) from an egocentric perspective. However, several experiments have provided evidence that e...
Falko Kellner, Benjamin Bolte, Gerd Bruder, Ulrich...
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 10 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra