This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Abstract. Constraint logic programming combines declarativity and efficiency thanks to constraint solvers implemented for specific domains. Value withdrawal explanations have been ...
Registration of an image, the query or reference, to a database of rotated and translated exemplars constitutes an important image retrieval and indexing application which arises i...
Huzefa Neemuchwala, Alfred O. Hero, Paul L. Carson