CAV
2006
Springer
13 years 8 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
ANTSW
2006
Springer
13 years 8 months ago
2006
Springer
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper presents a new algorithm for the problem of robust subspace learning (RSL), i.e., the estimation of linear subspace parameters from a set of data points in the presence...