Results 1  10
of
3,260
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
, 2008
"... This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope classes with exponent α. The minimax redundancy of exponentia ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the marginal distribution, namely exponentially decreasing envelope classes with exponent α. The minimax redundancy
Exponentially Decreasing Number of Operations in Balanced Trees
, 2000
"... Requiring only very few and natural conditions to be fullled for operations on treelike structures, we prove that amortized constanttime operations imply that the number of operations carried out at a given distance from the leaves decreases exponentially in that distance. This means that with ver ..."
Abstract
 Add to MetaCart
Requiring only very few and natural conditions to be fullled for operations on treelike structures, we prove that amortized constanttime operations imply that the number of operations carried out at a given distance from the leaves decreases exponentially in that distance. This means
A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function
, 1995
"... We describe a robust method for spatial registration, which relies on the coarse correspondence of structures extracted from images, avoiding the establishment of point correspondences. These structures #tokens# are points, chains, polygons and regions at the level of intermediate symbolic represent ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
representation #ISR#. The algorithm recovers conformal transformations #4 affine parameters#, so that 2dimensional scenes as well as planar structures in 3D scenes can be handled. The affine transformation between two different tokensets is found by minimization of an exponentially decreasing distance function
Selective sampling using the Query by Committee algorithm
 Machine Learning
, 1997
"... We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the twomember committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the numbe ..."
Abstract

Cited by 433 (7 self)
 Add to MetaCart
We analyze the "query by committee" algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the twomember committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially
On the existence of exponentially decreasing solutions of the nonlinear Landau damping problem
 Indiana Univ. Math. J
, 2009
"... Abstract. In this paper we prove the existence of a large class of periodic solutions of the VlasovPoisson in one space dimension that decay exponentially as t → ∞. The exponential decay is well known for the linearized version of the Landau damping problem. The results in this paper provide the f ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. In this paper we prove the existence of a large class of periodic solutions of the VlasovPoisson in one space dimension that decay exponentially as t → ∞. The exponential decay is well known for the linearized version of the Landau damping problem. The results in this paper provide
Enhancement of IEEE 802.11 distributed coordination function with exponential increase exponential decrease backoff algorithm
 IEEE VTC
, 2003
"... Abstract — A new backoff algorithm is proposed to enhance the performance of the IEEE 802.11 Distributed Coordination Function (DCF) which employs Binary Exponential Backoff (BEB) algorithm. The proposed algorithm, called the Exponential Increase Exponential Decrease (EIED) backoff algorithm, is qui ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
Abstract — A new backoff algorithm is proposed to enhance the performance of the IEEE 802.11 Distributed Coordination Function (DCF) which employs Binary Exponential Backoff (BEB) algorithm. The proposed algorithm, called the Exponential Increase Exponential Decrease (EIED) backoff algorithm
BRANCHING RANDOM WALK WITH EXPONENTIALLY DECREASING STEPS, AND STOCHASTICALLY SELFSIMILAR MEASURES
, 2007
"... Abstract. We consider a Branching Random Walk on R whose step size decreases by a fixed factor, 0 < λ < 1, with each turn. This process generates a random probability measure on R, that is, the limit of uniform distribution among the 2 n particles of the nth step. We present an initial invest ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We consider a Branching Random Walk on R whose step size decreases by a fixed factor, 0 < λ < 1, with each turn. This process generates a random probability measure on R, that is, the limit of uniform distribution among the 2 n particles of the nth step. We present an initial
Query by Committee
, 1992
"... We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the highlow game and perceptron learning of another perceptr ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
perceptron. As the number of queries goes to infinity, the committee algorithm yields asymptotically finite information gain. This leads to generalization error that decreases exponentially with the number of examples. This in marked contrast to learning from randomly chosen inputs, for which the information
Exponentially Decreased Dimension Number Strategy Based Dynamic Search Fireworks Algorithm for Solving CEC2015 Competition Problems
"... Abstract—Fireworks algorithm (FWA) is one swarm intelligence algorithm proposed in 2010, which takes the inspiration from the firework explosion process. Compared with other metaheuristic algorithms, FWA presents a cooperative explosive search manner. In the explosive search manner, the explosion ..."
Abstract
 Add to MetaCart
, then the exponentially decreased explosion dimension number strategy is introduced for the most recent dynamic search fireworks algorithm (dynFWA), called eddynFWA, to enhance its local search ability. To validate the performance of eddynFWA, it is used to participate in the CEC 2015 competition for solving learning
Results 1  10
of
3,260