513 search results - page 5 / 103 » Finitely Based, Finite Sets of Words |
NIPS
2004
13 years 9 months ago
2004
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...
SMC
2010
IEEE
13 years 6 months ago
2010
IEEE
—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...
ACL
1997
13 years 9 months ago
1997
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...
JUCS
2002
13 years 8 months ago
2002
: 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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
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...