Sciweavers

6719 search results - page 180 / 1344
» A Generalization of Automatic Sequences
Sort
View
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 12 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
AAAI
1996
13 years 11 months ago
Robot Navigation Using Image Sequences
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
Christopher Rasmussen, Gregory D. Hager
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 10 months ago
Sources of Superlinearity in Davenport-Schinzel Sequences
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problem...
Seth Pettie
JCT
1998
76views more  JCT 1998»
13 years 9 months ago
Progressions in Sequences of Nearly Consecutive Integers
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....
Noga Alon, Ayal Zaks