412 search results - page 22 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
SIAMMAX
2011
14 years 6 months ago
2011
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
STOC
2004
ACM
16 years 1 days ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
IJON
2010
14 years 6 months ago
2010
This paper explores an application of support vector regression (SVR) to model predictive control (MPC). SVR is employed to identify a dynamic system from input-output data, and t...