ISCIS
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
ICCNMC
2005
Springer
13 years 10 months ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
PLDI
2005
ACM
13 years 10 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
IMC
2005
ACM
13 years 10 months ago
2005
ACM
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
ACMMSP
2005
ACM
13 years 10 months ago
2005
ACM
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
SMI
2005
IEEE
13 years 10 months ago
2005
IEEE
We propose a new data structure for the compact encoding of a Level-Of-Detail (LOD) model of a threedimensional scalar field based on unstructured tetrahedral meshes. Such data s...
ICNP
2005
IEEE
13 years 10 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...