In a previous work, we developed a quasi-efficient maximum likelihood approach for blindly separating stationary, temporally correlated sources modeled by Markov processes. In this...
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the cu...
A method for the recovery of the temporal structure and phasesin natural gesture is presented. The work is motivated by recent developments in the theory of natural gesture which ...
Andrew D. Wilson, Aaron F. Bobick, Justine Cassell
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...