Results 1  10
of
2,731
Linear Differential Equations In Exponential Extensions
"... We present an algorithm to compute rational solutions of linear dierential equations with coecients in exponential extensions of monomial extensions of a base eld. We focus on the system of generators describing the extension and show why some of the generators sets are more \suitable" tha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present an algorithm to compute rational solutions of linear dierential equations with coecients in exponential extensions of monomial extensions of a base eld. We focus on the system of generators describing the extension and show why some of the generators sets are more \suitable
Factorization of Linear Differential Operators in Exponential Extensions
 In Proc. of ISSAC03
, 2003
"... We present here an algorithm for an ecient computation of factorizations of linear dierential operators with power series coecients in an exponential extension of a base eld. This algorithm is based on the results presented by Mark van Hoeij on factorization of linear dierential operators with coec ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present here an algorithm for an ecient computation of factorizations of linear dierential operators with power series coecients in an exponential extension of a base eld. This algorithm is based on the results presented by Mark van Hoeij on factorization of linear dierential operators
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract

Cited by 1869 (1 self)
 Add to MetaCart
slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 574 (9 self)
 Add to MetaCart
chosen element of the given ensemble will achieve an arbitrarily small target probability of error with a probability that approaches one exponentially fast in the length of the code. (By concatenating with an appropriate outer code one can achieve a probability of error that approaches zero
The WienerAskey Polynomial Chaos for Stochastic Differential Equations
 SIAM J. SCI. COMPUT
, 2002
"... We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener's polynomial chaos. Specifically, we represent the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces the dime ..."
Abstract

Cited by 398 (42 self)
 Add to MetaCart
We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener's polynomial chaos. Specifically, we represent the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces
An AutomataTheoretic Approach to BranchingTime Model Checking
 JOURNAL OF THE ACM
, 1998
"... Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automatatheoretic techniques ..."
Abstract

Cited by 354 (66 self)
 Add to MetaCart
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata
Bucket Elimination: A Unifying Framework for Reasoning
"... Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problemsolving and reasoning tasks. Algorithms such as directionalresolution for propositional satisfiability, adaptiveconsistency for constraint satisfaction, Fourier and Gaussian elimination ..."
Abstract

Cited by 298 (58 self)
 Add to MetaCart
, finding the most probable explanation, and expected utility maximization. These algorithms share the same performance guarantees; all are time and space exponential in the inducedwidth of the problem's interaction graph. While elimination strategies have extensive demands on memory, a contrasting
Power law and exponential decay of inter contact times between mobile devices
, 2007
"... We examine the fundamental properties that determine the basic performance metrics for opportunistic communications. We first consider the distribution of intercontact times between mobile devices. Using a diverse set of measured mobility traces, we find as an invariant property that there is a cha ..."
Abstract

Cited by 195 (2 self)
 Add to MetaCart
characteristic time, order of half a day, beyond which the distribution decays exponentially. Up to this value, the distribution in many cases follows a power law, as shown in recent work. This power law finding was previously used to support the hypothesis that intercontact time has a power law tail
Forecasting the term structure of government bond yields
 Journal of Econometrics
, 2006
"... Despite powerful advances in yield curve modeling in the last twenty years, comparatively little attention has been paid to the key practical problem of forecasting the yield curve. In this paper we do so. We use neither the noarbitrage approach, which focuses on accurately fitting the cross sectio ..."
Abstract

Cited by 287 (16 self)
 Add to MetaCart
to forecast poorly. Instead, we use variations on the NelsonSiegel exponential components framework to model the entire yield curve, periodbyperiod, as a threedimensional parameter evolving dynamically. We show that the three timevarying parameters may be interpreted as factors corresponding to level
Results 1  10
of
2,731