Sciweavers

498 search results - page 41 / 100
» New Constructions for IPP Codes
Sort
View
EUROCRYPT
2007
Springer
15 years 8 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
15 years 7 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 1 months ago
High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
Jagadeesh Harshan, B. Sundar Rajan
IPPS
2007
IEEE
15 years 8 months ago
Load Miss Prediction - Exploiting Power Performance Trade-offs
— Modern CPUs operate at GHz frequencies, but the latencies of memory accesses are still relatively large, in the order of hundreds of cycles. Deeper cache hierarchies with large...
Konrad Malkowski, Greg M. Link, Padma Raghavan, Ma...
ECCC
2006
77views more  ECCC 2006»
15 years 1 months ago
Extractors and condensers from univariate polynomials
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
Venkatesan Guruswami, Christopher Umans, Salil P. ...