Sciweavers

1449 search results - page 22 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
92
Voted
ICARIS
2009
Springer
15 years 4 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
ATAL
2010
Springer
15 years 1 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
DAGSTUHL
2007
15 years 1 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
FS
2006
123views more  FS 2006»
15 years 14 days ago
American Parisian options
Using the solution of the one-sided exit problem, a procedure to price Parisian barrier options in a jump-diffusion model with two-sided exponential jumps is developed. By extendin...
Marc Chesney, Laurent Gauthier
79
Voted
MOC
2002
92views more  MOC 2002»
15 years 3 days ago
Asymptotic properties of the spectral test, diaphony, and related quantities
This paper presents the limit laws of discrepancies defined via exponential sums, and algorithms (with error bounds) to approximate the corresponding distribution functions. The re...
Hannes Leeb