Computing compound distributions faster!

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing sparse permanents faster

Bax and Franklin (2002) gave a randomized algorithm for exactly computing the permanent of any n × n zero-one matrix in expected time exp [

متن کامل

Subtraction makes computing integers faster

We show some facts regarding the question whether, for any number n, the length of the shortest Addition Multiplications Chain (AMC) computing n is polynomial in the length of the shortest division-free Straight Line Program (SLP) that computes n. If the answer to this question is “yes”, then we can show a stronger upper bound for PosSLP, the important problem which essentially captures the not...

متن کامل

Computing Small Discrete Logarithms Faster

Computations of small discrete logarithms are feasible even in “secure” groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption. This paper shows how to use a small group-specific table to accelerate these subrout...

متن کامل

Efficient Numerical Inversion of Characteristic Functions for Computing Tails of Compound Distributions

An adaptive direct numerical integration (DNI) algorithm is developed for inverting characteristic functions of compound distributions, enabling efficient computations of high quantiles and conditional Value at Risk (CVaR). A key innovation of the numerical scheme is an effective tail integration approximation that reduces the truncation errors significantly. High precision results of the 0.999...

متن کامل

Faster Database Search for Quantum computing

We propose a new algorithm for quantum database search. Our strategy is to partition the space of all possibilities into subspaces and use a judiciously chosen projection operator as a polarizer in every subspace to filter out the states which have the correct first n-2 qubits. Then we use Grover’s algorithm to determine which one of the four survived states is the oracle. This algorithm has th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Insurance: Mathematics and Economics

سال: 1997

ISSN: 0167-6687

DOI: 10.1016/s0167-6687(97)00002-4