Sciweavers

412 search results - page 61 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
DCC
2002
IEEE
15 years 11 months ago
Rate-Based versus Distortion-Based Optimal Joint Source-Channel Coding
- We consider a joint source-channel coding system that protects an embedded wavelet bitstream against noise using a finite family of channel codes with error detection and error c...
Raouf Hamzaoui, Vladimir Stankovic
ICPP
2007
IEEE
15 years 6 months ago
Architectural Challenges in Memory-Intensive, Real-Time Image Forming
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
Anders Ahlander, H. Hellsten, K. Lind, J. Lindgren...
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 2 days ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
IM
2007
14 years 11 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
JMLR
2010
101views more  JMLR 2010»
14 years 6 months ago
Efficient Reductions for Imitation Learning
Imitation Learning, while applied successfully on many large real-world problems, is typically addressed as a standard supervised learning problem, where it is assumed the trainin...
Stéphane Ross, Drew Bagnell