Results 21  30
of
3,260
AIMD algorithms and exponential functionals
 Ann. Appl. Probab
, 2002
"... ABSTRACT. The behavior of connection transmitting packets into a network according to a general additiveincrease multiplicativedecrease (AIMD) algorithm is investigated. It is assumed that loss of packets occurs in clumps. When a packet is lost, a certain number of subsequent packets are also lost ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
ABSTRACT. The behavior of connection transmitting packets into a network according to a general additiveincrease multiplicativedecrease (AIMD) algorithm is investigated. It is assumed that loss of packets occurs in clumps. When a packet is lost, a certain number of subsequent packets are also
On Randomized Network Coding
 In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing
, 2003
"... We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delayfree netwo ..."
Abstract

Cited by 200 (35 self)
 Add to MetaCart
free networks, a bound on error probability, in terms of the number of receivers and random coding output links, that decreases exponentially with code length. The proof was based on a result in [2] relating algebraic network coding to network flows. In this paper, we generalize these results to networks
On recurrence coefficients for rapidly decreasing exponential weights
 J. Approx. Theory
"... Abstract. Let, for example, W (x) = exp exp k 1 x 2, x 2 [ 1; 1] where> 0, k 1; and exp k = exp (exp (::: exp ())) denotes the kth iterated exponential. Let fAng denote the recurrence coe ¢cients in the recurrence relation xpn (x) = Anpn+1 (x) + An 1pn 1 (x) for the orthonormal polynomials fpn ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Let, for example, W (x) = exp exp k 1 x 2, x 2 [ 1; 1] where> 0, k 1; and exp k = exp (exp (::: exp ())) denotes the kth iterated exponential. Let fAng denote the recurrence coe ¢cients in the recurrence relation xpn (x) = Anpn+1 (x) + An 1pn 1 (x) for the orthonormal polynomials
Exponential grids in highdimensional space
, 2011
"... We consider the approximation of functions that are localized in space. We show that it is possible to define meshes to approximate such functions with the property that the number of vertices grows only linearly in dimension. In one dimension, we discuss the optimal mesh for approximating exponenti ..."
Abstract
 Add to MetaCart
exponentially decreasing functions. We review the use of Cartesian product grids in multiple dimensions introduced in a paper of Bank and Scott [4].
Proactive Serving Decreases User Delay Exponentially
"... In online service systems, the delay experienced by a user from the service request to the service completion is one of the most critical performance metrics. To improve user delay experience, recent industrial practice suggests a modern system design mechanism: proactive serving, where the system ..."
Abstract
 Add to MetaCart
tem predicts future user requests and allocates its capacity to serve these upcoming requests proactively. In this paper, we investigate the fundamentals of proactive serving from a theoretical perspective. In particular, we show that proactive serving decreases average delay exponentially (as a function
Comparing elliptic curve cryptography and RSA on 8bit CPUs
 in Proc. of the Sixth Workshop on Crypto graphic Hardware and Embedded Systems (CHES’04
, 2004
"... Abstract. Strong publickey cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement and implemented elliptic curve point multiplication for 160bit, 192bit, and 224bit NIST/SECG curves over GF ..."
Abstract

Cited by 189 (2 self)
 Add to MetaCart
hardware acceleration. On an Atmel ATmega128 at 8 MHz we measured 0.81s for 160bit ECC point multiplication and 0.43s for a RSA1024 operation with exponent e = 216 +1. 2. The relative performance advantage of ECC point multiplication over RSA modular exponentiation increases with the decrease
The ultrawide bandwidth indoor channel: from statistical model to simulations
 IEEE J. SEL. AREAS COMMUN
, 2002
"... We establish a statistical model for the ultrawide bandwidth (UWB) indoor channel based on an extensive measurement campaign in a typical modern office building with 2ns delay resolution. The approach is based on the investigation of the statistical properties of the multipath profiles measured i ..."
Abstract

Cited by 185 (13 self)
 Add to MetaCart
in different rooms over a finely spaced measurement grid. The analysis leads to the formulation of a stochastic tappeddelayline (STDL) model of the UWB indoor channel. The averaged power delay profile can be wellmodeled by a single exponential decay with a statistically distributed decay constant. The small
Fixed energy inverse problem for exponentially decaying potentials
 Methods and Applications of Analysis
"... In this paper we show that in twobody scattering the scattering matrix at a fixed energy determines realvalued exponentially decreasing potentials. This result has been proved by Novikov previously [4], see also [3], using a ∂equation. We present a different method, which combines a density argum ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In this paper we show that in twobody scattering the scattering matrix at a fixed energy determines realvalued exponentially decreasing potentials. This result has been proved by Novikov previously [4], see also [3], using a ∂equation. We present a different method, which combines a density
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
prediction of the future reward together with the contingency that associates the behavioral action to the reward Motivational Valence Punishers have opposite valence to rewards, induce withdrawal behavior, and act as negative reinforcers by increasing the behavior that results in decreasing the aversive
The estimation of the model order in exponential families
 IEEE Trans. Inform. Theory
, 1989
"... AbstractThe estimation of the model order in exponential families is studied. Estimators are sought that achieve high exponential rate of decrease in the underestimation probability while keeping the overestimation probability exponent at a certain prescribed level. It is assumed that a ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
AbstractThe estimation of the model order in exponential families is studied. Estimators are sought that achieve high exponential rate of decrease in the underestimation probability while keeping the overestimation probability exponent at a certain prescribed level. It is assumed that a
Results 21  30
of
3,260