3096 search results - page 107 / 620 » The Generalized FITC Approximation |
CRYPTO
1994
Springer
14 years 28 days ago
1994
Springer
We present a technique which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack. We note the limit...
SODA
1997
ACM
13 years 10 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set uppe...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
MP
2006
13 years 8 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...