495 search results - page 28 / 99 » Automata and differentiable words |
STRINGOLOGY
2008
13 years 9 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
DAI
1998
Springer
14 years 9 hour ago
1998
Springer
A physically based system of interacting polyhedral objects is used to model self-assembly and spontaneous organization of complex structures. The surfaces of the polyhedra in the ...
FCT
1991
Springer
13 years 11 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...
HCW
1999
IEEE
14 years 2 days ago
1999
IEEE
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...