Sciweavers

329 search results - page 37 / 66
» Probably Approximately Correct Learning
Sort
View
IJCAI
1993
13 years 9 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 9 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
AAAI
2011
12 years 7 months ago
Learning Accuracy and Availability of Humans Who Help Mobile Robots
When mobile robots perform tasks in environments with humans, it seems appropriate for the robots to rely on such humans for help instead of dedicated human oracles or supervisors...
Stephanie Rosenthal, Manuela M. Veloso, Anind K. D...
ICML
2010
IEEE
13 years 8 months ago
Improved Local Coordinate Coding using Local Tangents
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...
Kai Yu, Tong Zhang
UAI
1996
13 years 9 months ago
Bayesian Learning of Loglinear Models for Neural Connectivity
This paper presents a Bayesian approach to learning the connectivity structure of a group of neurons from data on configuration frequencies. A major objective of the research is t...
Kathryn B. Laskey, Laura Martignon