1403 search results - page 35 / 281 » About Approximations of Exponentials |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
120
click to vote
IPSN
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
71
Voted
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
93
Voted
COCO
2006
Springer
15 years 2 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
108
click to vote
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...