Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...
—In this paper we describe a fully integrated system for detecting and tracking pedestrians in a dynamic urban environment. The system can reliably detect and track pedestrians t...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma, D. ...
We propose a new method of classifying documents into categories. We define for each category a finite mixture model based on soft clustering of words. We treat the problem of cla...
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Let S be a finite set of words such that Fact(S ) = . We deal with the problem of finding bounds on the minimal length of words in \ Fact(S ) in terms of the maximal length of wor...
Gabriele Fici, Elena V. Pribavkina, Jacques Sakaro...