Sciweavers

1578 search results - page 67 / 316
» Induction of Stable Models
Sort
View
COLING
2008
13 years 9 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport
AUTOMATICA
2004
68views more  AUTOMATICA 2004»
13 years 7 months ago
Implicit fault-tolerant control: application to induction motors
In this paper we propose an innovative way of dealing with the design of fault-tolerant control systems. We show how the nonlinear output regulation theory can be successfully ado...
Claudio Bonivento, Alberto Isidori, Lorenzo Marcon...
ENTCS
2002
112views more  ENTCS 2002»
13 years 7 months ago
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
Ivan Scagnetto, Marino Miculan
EMNLP
2010
13 years 5 months ago
Using Universal Linguistic Knowledge to Guide Grammar Induction
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
Tahira Naseem, Harr Chen, Regina Barzilay, Mark Jo...
JMLR
2010
123views more  JMLR 2010»
13 years 2 months ago
Inductive Principles for Restricted Boltzmann Machine Learning
Recent research has seen the proposal of several new inductive principles designed specifically to avoid the problems associated with maximum likelihood learning in models with in...
Benjamin Marlin, Kevin Swersky, Bo Chen, Nando de ...