Sciweavers

Share
CN
2008
110views more  CN 2008»
8 years 4 months ago
The eternal sunshine of the sketch data structure
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...
Xenofontas A. Dimitropoulos, Marc Ph. Stoecklin, P...
GLOBECOM
2008
IEEE
8 years 4 months ago
Highly Memory-Efficient LogLog Hash for Deep Packet Inspection
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...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
ICANN
2010
Springer
8 years 4 months ago
Tumble Tree - Reducing Complexity of the Growing Cells Approach
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...
Hendrik Annuth, Christian-A. Bohn
SPAA
2010
ACM
8 years 4 months ago
A universal construction for wait-free transaction friendly data structures
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...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
DIMVA
2009
8 years 5 months ago
Polymorphing Software by Randomizing Data Structure Layout
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
Zhiqiang Lin, Ryan Riley, Dongyan Xu
WDAS
2000
8 years 5 months ago
Scalable Distributed Data Structures: A Survey
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...
Adriano Di Pasquale, Enrico Nardelli
UAI
2000
8 years 5 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
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...
Andrew W. Moore
GRAPHICSINTERFACE
1997
8 years 5 months ago
Multiresolution BSP Trees Applied to Terrain, Transparency, and General Objects
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...
Charles Wiley, A. T. Campbell III, Stephen A. Szyg...
DAGSTUHL
1998
8 years 5 months ago
Segmented Iterators and Hierarchical Algorithms
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...
Matthew H. Austern
WAE
2001
236views Algorithms» more  WAE 2001»
8 years 5 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
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...
Jyrki Katajainen, Bjarke Buur Mortensen
books