Sciweavers

679 search results - page 50 / 136
» Approximate Temporal Aggregation
Sort
View
ML
2002
ACM
168views Machine Learning» more  ML 2002»
13 years 8 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
INFOCOM
2009
IEEE
14 years 3 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 24 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
ICASSP
2011
IEEE
13 years 7 days ago
Compressive sampling with a successive approximation ADC architecture
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
Chenchi Luo, James H. McClellan
IPSN
2007
Springer
14 years 2 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri