412 search results - page 11 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
75
Voted
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—To respond to variations in solar energy, harvestedenergy prediction is essential to harvested-energy management approaches. The effectiveness of such approaches is depe...
118
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
76
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
JMLR
2008
14 years 9 months ago
2008
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...