Sciweavers

1400 search results - page 202 / 280
» On multiplication in finite fields
Sort
View
ECCC
2006
120views more  ECCC 2006»
13 years 10 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CAD
2007
Springer
13 years 10 months ago
Direct extraction of surface meshes from implicitly represented heterogeneous volumes
This paper describes a novel algorithm to extract surface meshes directly from implicitly represented heterogeneous models made of different constituent materials. Our approach ca...
Charlie C. L. Wang
TIT
2008
164views more  TIT 2008»
13 years 10 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
TSP
2008
101views more  TSP 2008»
13 years 10 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
AMC
2004
108views more  AMC 2004»
13 years 10 months ago
A variational approach to magnetic resonance coil sensitivity estimation
Abstract. A variational method for estimating a magnetic resonance coil sensitivity from its corresponding nonuniform illumination of magnetic resonance images is proposed and anal...
Stephen L. Keeling, Roland Bammer