Sciweavers

619 search results - page 53 / 124
» Generic Extensions and Generic Polynomials
Sort
View
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
14 years 1 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...
AAECC
2010
Springer
132views Algorithms» more  AAECC 2010»
13 years 7 months ago
On the geometry of polar varieties
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...
Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey ...
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 7 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura