590 search results - page 91 / 118 » Can We Learn to Beat the Best Stock |
ISDA
2008
IEEE
15 years 4 months ago
2008
IEEE
Gene network reconstruction is a multidisciplinary research area involving data mining, machine learning, statistics, ontologies and others. Reconstructed gene network allows us t...
PEPM
2011
ACM
14 years 16 days ago
2011
ACM
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
MCS
2010
Springer
14 years 11 months ago
2010
Springer
In a multiple classifier system, dynamic selection (DS) has been used successfully to choose only the best subset of classifiers to recognize the test samples. Dos Santos et al...
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
124
click to vote
NAACL
2010
14 years 7 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...