Sciweavers

412 search results - page 17 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
ESANN
2000
15 years 1 months ago
Committee formation for reliable and accurate neural prediction in industry
Abstract. This paper describes "cranking", a new committee formation algorithm. Cranking results in accurate and reliable committee predictions, even when applied to comp...
Peter J. Edwards, Alan F. Murray
SOCO
2002
Springer
14 years 11 months ago
Granular neural web agents for stock prediction
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...
Yan-Qing Zhang, Somasheker Akkaladevi, George J. V...
PUC
2010
97views more  PUC 2010»
14 years 10 months ago
Where will they turn: predicting turn proportions at intersections
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...
John Krumm
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 5 months ago
New Results on the Complexity of the Middle Bit of Multiplication
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...
Ingo Wegener, Philipp Woelfel
ICASSP
2008
IEEE
15 years 6 months ago
Predictive fusion coding of spatio-temporally correlated sources
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...
Sharadh Ramaswamy, Kenneth Rose