Sciweavers

1099 search results - page 66 / 220
» Factored sequence kernels
Sort
View
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
15 years 2 months ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
HRI
2009
ACM
15 years 4 months ago
The power of suggestion: teaching sequences through assistive robot motions
We present a preliminary implementation of a robot within the context of social skills intervention. The robot engages a human user in an interactive and adaptive game-playing ses...
Ross Mead, Maja J. Mataric
IMA
2001
Springer
80views Cryptology» more  IMA 2001»
15 years 2 months ago
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
Matthew G. Parker
CIKM
1998
Springer
15 years 2 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
DLT
2008
14 years 11 months ago
Relationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni