Sciweavers

412 search results - page 6 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
ICPR
2002
IEEE
15 years 2 months ago
Motion Prediction Using VC-Generalization Bounds
This paper describes a novel application of Statistical Learning Theory (SLT) for motion prediction. SLT provides analytical VC-generalization bounds for model selection; these bo...
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Ch...
ICMCS
2008
IEEE
175views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Fast mode decision for adaptive prediction error coding
In [1], Adaptive Prediction Error Coding (APEC) in spatial and frequency domain is proposed and significantly improves the coding efficiency of video coders. However, this approac...
Cixun Zhang, Kemal Ugur, Moncef Gabbouj
VTC
2007
IEEE
113views Communications» more  VTC 2007»
15 years 3 months ago
Channel Prediction Heuristics for Adaptive Modulation in WLAN
— Channel-adaptive techniques increase the efficiency of wireless communications, as they are efficient in coping with the quality variation of the wireless channels. However, ...
Ana Aguiar, Adam Wolisz
67
Voted
WAIM
2007
Springer
15 years 3 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
14 years 10 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan