Sciweavers

3416 search results - page 26 / 684
» Can Machines Learn Logics
Sort
View
ALT
2010
Springer
15 years 7 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
PG
2003
IEEE
15 years 11 months ago
Machine Learning for Computer Graphics: A Manifesto and Tutorial
I argue that computer graphics can benefit from a deeper use of machine learning techniques. I give an overview of what learning has to offer the graphics community, with an emph...
Aaron Hertzmann
ITS
2010
Springer
115views Multimedia» more  ITS 2010»
15 years 10 months ago
In the Zone: Towards Detecting Student Zoning Out Using Supervised Machine Learning
This paper explores automatically detecting student zoning out while performing a spoken learning task. Standard supervised machine learning techniques were used to create classi...
Joanna Drummond, Diane J. Litman
STACS
1999
Springer
15 years 10 months ago
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
Clemens Lautemann, Nicole Schweikardt, Thomas Schw...
ICML
2007
IEEE
16 years 6 months ago
Transductive support vector machines for structured variables
We study the problem of learning kernel machines transductively for structured output variables. Transductive learning can be reduced to combinatorial optimization problems over a...
Alexander Zien, Ulf Brefeld, Tobias Scheffer