Sciweavers

11784 search results - page 92 / 2357
» Interpolation for data structures
Sort
View
ESANN
2007
15 years 21 days ago
"Kernelized" Self-Organizing Maps for Structured Data
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 ...
IV
2002
IEEE
126views Visualization» more  IV 2002»
15 years 4 months ago
The Empathic Visualisation Algorithm (EVA) - An Automatic Mapping from Abstract Data to Naturalistic Visual Structure
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 ...
Andreas Loizides, Mel Slater
IDA
2007
Springer
15 years 5 months ago
Visualising the Cluster Structure of Data Streams
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...
IEEEPACT
2003
IEEE
15 years 4 months ago
Compiler-Directed Content-Aware Prefetching for Dynamic Data Structures
This paper describes Compiler-Directed Content-Aware Prefetching (CDCAP), an integrated compiler and hardware approach for prefetching dynamic data structures. The approach utiliz...
Hassan Al-Sukhni, Ian Bratt, Daniel A. Connors
PODC
2010
ACM
15 years 3 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer