Sciweavers

4544 search results - page 276 / 909
» Reinforcement Learning with Time
Sort
View
COLT
1993
Springer
15 years 4 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 4 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
107
Voted
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 1 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
123
Voted
PERCOM
2005
ACM
16 years 7 days ago
Secure Routing and Intrusion Detection in Ad Hoc Networks
Numerous schemes have been proposed for secure routing protocols, and Intrusion Detection and Response Systems, for ad hoc networks. In this paper, we present a proof-of-concept i...
Anand Patwardhan, Jim Parker, Anupam Joshi, Michae...
SASO
2009
IEEE
15 years 7 months ago
Self-organizing Bandwidth Sharing in Priority-Based Medium Access
In this paper, we present an analysis of self-organizing bandwidth sharing in priority-based medium access. For this purpose, the priority-based Access Game is introduced. Analysi...
Stefan Wildermann, Tobias Ziermann, Jürgen Te...