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...
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...
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...
A probabilistic, ``neural'' approach to sensor modelling and classification is described, performing local data fusion in a wireless system for embedded sensors using a ...
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...