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...
Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in search of patterns, anomalies, and other interesting ...
Ying-Huey Fua, Matthew O. Ward, Elke A. Rundenstei...
Although usually classifier error is the main concern in publications, in real applications classifier evaluation complexity may play a large role as well. In this paper, a simple...
Dick de Ridder, Elzbieta Pekalska, Robert P. W. Du...
The rapid progress in digital music distribution has lead to the creation of large collections of music. There is a need for content-based music classification methods to organiz...
Stefan Brecheisen, Hans-Peter Kriegel, Peter Kunat...
—This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing p...