This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Clustering is an important data mining problem. However, most earlier work on clustering focused on numeric attributes which have a natural ordering to their attribute values. Rec...
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...