In this paper, we present a least square kernel machine with box constraints (LSKMBC). The existing least square machines assume Gaussian hyperpriors and subsequently express the ...
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
Spider diagrams are a visual logic capable of makeing statements about relationships between sets and their cardinalities. Various meta-level results for spider diagrams have been...
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...