A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
Effective usage of multimedia digital libraries has to deal with the problem of building efficient content annotation and retrieval tools. MOM (Multimedia Ontology Manager) is a ...
We present an approach to the question of evaluating worm defenses against future, yet unseen and possibly defense-aware worm behavior. Our scheme employs model checking to produc...