CN
2008
13 years 4 months ago
2008
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
GLOBECOM
2008
IEEE
13 years 4 months ago
2008
IEEE
As the network line rates reach 40 Gbps today and 100 Gbps in the near future, performing deep packet inspection (DPI) in the Network Intrusion Detection and Prevention Systems (NI...
ICANN
2010
Springer
13 years 4 months ago
2010
Springer
We propose a data structure that decreases complexity of unsupervised competitive learning algorithms which are based on the growing cells structures approach. The idea is based on...
SPAA
2010
ACM
13 years 4 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
DIMVA
2009
13 years 5 months ago
2009
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
WDAS
2000
13 years 5 months ago
2000
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
UAI
2000
13 years 5 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
GRAPHICSINTERFACE
1997
13 years 5 months ago
1997
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
DAGSTUHL
1998
13 years 5 months ago
1998
Abstract. Many data structures are naturally segmented. Generic algorithms that ignore that feature, and that treat every data structure as a uniform range of elements, are unneces...
WAE
2001
13 years 5 months ago
2001
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...