412 search results - page 76 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
SBCCI
2005
ACM
15 years 3 months ago
2005
ACM
This work addresses the problem of application mapping in networks-on-chip (NoCs). It explores the importance of characterizing network traffic to effectively predict NoC energy c...
ACMACE
2009
ACM
15 years 4 months ago
2009
ACM
Fantasy games, in which players compete to correctly predict realworld outcomes in sports, entertainment, and politics, have grown in popularity and now represent a significant po...
HYBRID
2010
Springer
15 years 4 months ago
2010
Springer
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
93
Voted
CG
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
83
Voted
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...