2040 search results - page 117 / 408 » On the Complexity of Error Explanation |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the test...
TVLSI
2008
13 years 9 months ago
2008
Abstract--Increasing demand for high-speed inter-chip interconnects requires faster links that consume less power. Channel coding can be used to lower the required signal-to-noise ...
RSA
2002
13 years 8 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
ICASSP
2011
IEEE
13 years 29 days ago
2011
IEEE
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
ICASSP
2011
IEEE
13 years 20 days ago
2011
IEEE
This paper considers linear precoding for time-varying multipleinput multiple-output (MIMO) channels. We show that linear minimum mean-squared error (LMMSE) equalization based on ...