Sciweavers

1047 search results - page 33 / 210
» Learning the required number of agents for complex tasks
Sort
View
CICLING
2004
Springer
14 years 1 months ago
Automatic Learning Features Using Bootstrapping for Text Categorization
When text categorization is applied to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. In this paper, we...
Wenliang Chen, Jingbo Zhu, Honglin Wu, Tianshun Ya...
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
ICDCIT
2005
Springer
14 years 1 months ago
Cleaning an Arbitrary Regular Network with Mobile Agents
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
Paola Flocchini, Amiya Nayak, Arno Schulz
ISVC
2007
Springer
14 years 1 months ago
Learning to Recognize Complex Actions Using Conditional Random Fields
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
Christopher I. Connolly
ALT
2010
Springer
13 years 9 months ago
Bayesian Active Learning Using Arbitrary Binary Valued Queries
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
Liu Yang, Steve Hanneke, Jaime G. Carbonell