Sciweavers

945 search results - page 36 / 189
» On the robustness of primitive words
Sort
View
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
15 years 10 months ago
On the Maximal Number of Cubic Subwords in a String
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
ICANN
2009
Springer
16 years 20 days ago
Basis Decomposition of Motion Trajectories Using Spatio-temporal NMF
Abstract. This paper’s intention is to present a new approach for decomposing motion trajectories. The proposed algorithm is based on nonnegative matrix factorization, which is a...
Sven Hellbach, Julian Eggert, Edgar Körner, H...
ASAP
2008
IEEE
118views Hardware» more  ASAP 2008»
16 years 17 days ago
Bit matrix multiplication in commodity processors
Registers in processors generally contain words or, with the addition of multimedia extensions, short vectors of subwords of bytes or 16-bit elements. In this paper, we view the c...
Yedidya Hilewitz, Cédric Lauradoux, Ruby B....
ENTCS
2007
150views more  ENTCS 2007»
15 years 5 months ago
On the Expressiveness of Mobile Synchronizing Petri Nets
In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a coll...
Fernando Rosa Velardo, David de Frutos-Escrig, Olg...
FLAIRS
2007
15 years 8 months ago
Verbal Polysemy in Automatic Annotation
The linguistic theory of Applicative and Cognitive Grammar analyses the language in three levels as follows: the linguistic level, the predicative level, and the semanticocognitiv...
Maryvonne Abraham