590 search results - page 98 / 118 » Can We Learn to Beat the Best Stock |
81
Voted
JMLR
2010
14 years 4 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
91
Voted
LLC
2010
14 years 4 months ago
2010
The quest to educate nonstandardized Englishspeaking students has been a primary driving force behind developments in many fields represented by Compass journals, including socio...
124
click to vote
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
3D object detection and importance regression/ranking are at the core for semantically interpreting 3D medical images of computer aided diagnosis (CAD). In this paper, we propose ...
106
Voted
PODC
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
83
Voted
RAID
1999
Springer
15 years 1 months ago
1999
Springer
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...