412 search results - page 75 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
72
Voted
TIT
1998
14 years 9 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
114
click to vote
JMLR
2010
14 years 4 months ago
2010
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
143
click to vote
CISS
2011
IEEE
14 years 1 months ago
2011
IEEE
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
109
click to vote
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...