35 search results - page 5 / 7 » Counting dependent and independent strings |
PAMI
2010
14 years 8 months ago
2010
—We consider the problem of inferring and modeling topics in a sequence of documents with known publication dates. The documents at a given time are each characterized by a topic...
ICDM
2006
IEEE
15 years 4 months ago
2006
IEEE
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would sugge...
ICALP
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
FIMI
2003
14 years 11 months ago
2003
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
CAV
1999
Springer
15 years 2 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...