412 search results - page 12 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
STACS
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
COCO
2009
Springer
15 years 6 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
108
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
WONS
2005
IEEE
15 years 5 months ago
2005
IEEE
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The noise power gain (NPG) is addressed and the error bound (EB) is specified via NPG for a general p-shift linear timevariant finite impulse response (FIR) transversal estimato...