Sciweavers

412 search results - page 9 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
ICMCS
2006
IEEE
140views Multimedia» more  ICMCS 2006»
15 years 3 months ago
A Fast Matching Pursuits Algorithm using Sub-Band Decomposition of Video Signals
A high-efficiency video coding method using matching pursuits, which is a waveform coding technique, has recently been proposed. In this method, the motion compensated prediction...
Kousuke Imamura, Yoshimasa Koba, Hideo Hashimoto
ICWN
2003
14 years 11 months ago
A Framework for Evaluating Effects of Channel Prediction Inaccuracy on the Performance of Channel Adaptive Techniques
—Adapting transmission parameters to the future channel state is an appealing approach to improve efficiency in wireless communication. Adaptation requires predicting the chann...
Ana Aguiar, Holger Karl, Adam Wolisz, Horst Miesme...
INFOCOM
2012
IEEE
12 years 12 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
86
Voted
ICCS
2007
Springer
15 years 3 months ago
Adaptive Observation Strategies for Forecast Error Minimization
Abstract. Using a scenario of multiple mobile observing platforms (UAVs) measuring weather variables in distributed regions of the Pacific, we are developing algorithms that will ...
Nicholas Roy, Han-Lim Choi, Daniel Gombos, James H...
68
Voted
ECCC
2010
122views more  ECCC 2010»
14 years 8 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah