Sciweavers

2040 search results - page 106 / 408
» On the Complexity of Error Explanation
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 11 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
ICMCS
2006
IEEE
140views Multimedia» more  ICMCS 2006»
15 years 10 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
COLT
2005
Springer
15 years 10 months ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
ICUMT
2009
15 years 2 months ago
SBCL - improved centroid estimation
Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
DCC
2010
IEEE
15 years 11 months ago
A Hybrid Media Transmission Scheme for Wireless VoIP
In this paper, we propose an optimization framework for real-time voice transmission over wireless tandem channels prone to both bit errors and packet erasures. Utilizing a hybrid...
Ala F. Khalifeh, Homayoun Yousefi'zadeh