412 search results - page 17 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ESANN
2000
15 years 3 months ago
2000
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
131
click to vote
SOCO
2002
Springer
15 years 1 months ago
2002
Springer
A granular neural Web-based stock prediction agent is developed using the granular neural network (GNN) that can discover fuzzy rules. Stock data sets are downloaded from www.yahoo...
104
Voted
PUC
2010
15 years 4 days ago
2010
Predicting a driver’s route would be useful for warning a driver of upcoming road hazards, informing about traffic situations, and serving relevant advertising. There are many cl...
COCO
2005
Springer
15 years 7 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
104
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper considers the problem of predictive fusion coding for storage of multiple spatio-temporally correlated sources so as to enable efficient selective retrieval of data fr...