569 search results - page 59 / 114 » Online Bounds for Bayesian Algorithms |
NIPS
2007
14 years 11 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
103
click to vote
CSR
2010
Springer
15 years 2 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
105
click to vote
JMLR
2010
14 years 4 months ago
2010
Security analysis of learning algorithms is gaining increasing importance, especially since they have become target of deliberate obstruction in certain applications. Some securit...
107
click to vote
ASIAN
2007
Springer
15 years 4 months ago
2007
Springer
Extensive use of computer networks and online electronic data and high demand for security has called for reliable intrusion detection systems. A repertoire of different classifier...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...