搜索结果: 1-15 共查到“知识库 Approximation”相关记录413条 . 查询时间(0.072 秒)
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors
foundations lattice techniques
2019/9/16
Abstract. There is a large gap between theory and practice in the complexities of sieving algorithms for solving the shortest vector problem in an arbitrary Euclidean lattice. In this paper, we work t...
Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation
public-key cryptography lattice techniques
2018/11/19
The lattice basis reduction algorithm is a method for solving the Shortest Vector Problem (SVP) on lattices. There are many variants of the lattice basis reduction algorithm such as LLL, BKZ, and RSR....
Fast Correlation Attacks over Extension Fields, Large-unit Linear Approximation and Cryptanalysis of SNOW 2.0
Stream ciphers Cryptanalysis Large-unit
2016/3/23
Several improvements of fast correlation attacks have been proposed during the past two decades, with a regrettable lack of a better generalization and adaptation to the concrete involved primitives, ...
Linear Sequential Circuit Approximation of Acterbahn Stream Cipher
Linear Distinguishing Attack Linear Sequential Circuit Approximation Achterbahn Stream Cipher
2016/1/23
Achterbahn stream cipher is proposed as a candidate for ECRYPT eSTREAM project which deals with key of length 80-bit. The linear distinguishing attack,which aims at distinguishing the keystream from p...
Stochastic Combinatorial Optimization via Poisson Approximation
Stochastic Knapsack Stochastic Bin Packing Expected Util- ity Maximization
2016/1/23
We study several stochastic combinatorial problems, includ-ing the expected utility maximization problem, the stochas-tic knapsack problem and the stochastic bin packing prob-lem. A common technical c...
A Fully Polynomial Approximation Scheme for Approximating a Sum of Random Variables
Threshold probability Tail probability Approximate counting Counting knapsack FPTAS
2016/1/22
Given n independent integer-valued random variables X 1 , X 2 ,..., X n and an integer C, we study the fundamental problem of computing the probability that the sum X = X 1 + X 2 +···+ X n is at most ...
Approximation Algorithms for the Connected Sensor Cover Problem
Approximation Algorithms Connected Sensor Cover Problem
2016/1/22
We study the minimum connected sensor cover problem(MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC)problem, both motivated by important applications in wireless sensor networks. In bot...
Linear Time Approximation Schemes for Geometric Maximum Coverage
Maximum coverage Geometric set cover Polynomial-time approximation scheme
2016/1/22
We study approximation algorithms for the following geo-metric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a × b rectangles such that ...
Saddlepoint Approximation for Moments of Random Variables
Saddlepoint Approximation Higher moments Sums of i.i.d.ran- dom variables
2016/1/19
In this paper we introduce a saddlepoint approximation method for higher-order moments like E(S − a) m+ ,a > 0, where the random variable S in these expectations could be a single random variabl...
Approximation of bivariate copulas by patched bivariate Fréchet copulas
Bivariate Fréchet copulas patched bivariate Fréchet copula approximation of bivariate copulas
2016/1/19
Bivariate Fréchet (BF) copulas characterize dependence as a mixture of three simple structures: comonotonicity, in-dependence and countermonotonicity. They are easily interpretable but have limitation...
Analysis of ARX Functions: Pseudo-linear Methods for Approximation, Differentials, and Evaluating Diffusion
ARX block ciphers hash functions
2016/1/6
This paper explores the approximation of addition mod 2n
by addition mod 2w, where
1 ≤ w ≤ n, in ARX functions that use large words (e.g., 32-bit words or 64-bit words). Three main areas
are explor...
DA-Encrypt: Homomorphic Encryption via Non-Archimedean Diophantine Approximation --- Preliminary Report
homomorphic encryption lattice-based cryptography
2015/12/23
We give a theoretical description of a new homomorphic encryption
scheme DA-Encrypt that is based on (non-archimedean) Diophantine
Approximation.
PAIR EXCITATIONS AND THE MEAN FIELD APPROXIMATION OF INTERACTING BOSONS, I
PAIR EXCITATIONS MEAN FIELD APPROXIMATION
2015/10/15
In our previous work [20],[21] we introduced a correction to the mean eld approximation of interacting Bosons. This
correction describes the evolution of pairs of particles that leave
the condensat...
The Convergenceof an Euler Approximation of an Initial ValueProblemIs Not Always Obvious
Euler Approximation Initial ValueProblemIs Not Always Obvious
2015/8/26
The Convergenceof an Euler Approximation of an Initial ValueProblemIs Not Always Obvious.
Di€usion approximation for nonparametric autoregression
Nonparametric experiments de® ciency distance likelihood ratio process stochastic di€ erential equation autoregression di€ usion sampling asymptotic su ciency
2015/8/25
A nonparametric statistical model of small di€usion type is compared with its discretization by a stochastic Euler di€erence scheme. It is shown that the discrete and continuous models are a...