Sciweavers

1220 search results - page 11 / 244
» Restricting grammatical complexity
Sort
View
ICGI
2010
Springer
13 years 6 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 7 days ago
Restricted real perturbation values with applications to the structured real controllability radius of LTI systems
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...
Simon Lam, Edward J. Davison
AIPS
2008
13 years 9 months ago
Causal Graphs and Structurally Restricted Planning
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
Hubie Chen, Omer Giménez
ESANN
2006
13 years 9 months ago
Adaptive Sensor Modelling and Classification using a Continuous Restricted Boltzmann Machine (CRBM)
A probabilistic, ``neural'' approach to sensor modelling and classification is described, performing local data fusion in a wireless system for embedded sensors using a ...
Tong Boon Tang, Alan F. Murray
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
14 years 1 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey