Sciweavers

3556 search results - page 186 / 712
» Can machine learning be secure
Sort
View
94
Voted
VOTEID
2007
Springer
15 years 6 months ago
Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator
It is debatable if current direct-recording electronic voting machines can sufficiently be trusted for a use in elections. Reports about malfunctions and possible ways of manipulat...
Jens-Matthias Bohli, Jörn Müller-Quade, ...
90
Voted
ICML
2008
IEEE
16 years 1 months ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
ICML
2006
IEEE
16 years 1 months ago
A statistical approach to rule learning
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
Stefan Kramer, Ulrich Rückert
112
Voted
ALT
2008
Springer
15 years 9 months ago
Learning with Temporary Memory
In the inductive inference framework of learning in the limit, a variation of the bounded example memory (Bem) language learning model is considered. Intuitively, the new model con...
Steffen Lange, Samuel E. Moelius, Sandra Zilles
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 21 days ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani