Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
The suitability of the well known kernels for trees, and the lesser known SelfOrganizing Map for Structures for categorization tasks on structured data is investigated in this pap...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
from Abstract Data to Naturalistic Visual Structure A. Loizides and M.Slater Department of Computer Science, University College London (UCL), London, UK This paper demonstrates a ...
The increasing availability of streaming data is a consequence of the continuing advancement of data acquisition technology. Such data provides new challenges to the various data a...
Dimitris K. Tasoulis, Gordon J. Ross, Niall M. Ada...