11394 search results - page 58 / 2279 » Error-Correcting Data Structures |
128
click to vote
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
ALGORITHMICA
2005
14 years 11 months ago
2005
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...
APWEB
2010
Springer
15 years 4 months ago
2010
Springer
The World Wide Web is witnessing an increase in the amount of structured content – vast heterogeneous collections of structured data are on the rise due to the Deep Web, annotat...
ESANN
2007
15 years 1 months ago
2007
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...
IV
2002
IEEE
15 years 4 months ago
2002
IEEE
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 ...