Sciweavers

237 search results - page 47 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 7 months ago
Towards 3-query locally decodable codes of subexponential length
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
ICS
2010
Tsinghua U.
14 years 4 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
CPHYSICS
2004
87views more  CPHYSICS 2004»
13 years 7 months ago
Vlasov simulations on an adaptive phase-space grid
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
Michael Gutnic, Matthieu Haefele, I. Paun, Eric So...
FPGA
2004
ACM
121views FPGA» more  FPGA 2004»
14 years 28 days ago
Divide and concatenate: a scalable hardware architecture for universal MAC
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...
Bo Yang, Ramesh Karri, David A. McGrew