PPOPP
2003
ACM
13 years 9 months ago
2003
ACM
InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointer-rich data structures across a wide variety of hardware architectures, operating ...
PODC
2003
ACM
13 years 9 months ago
2003
ACM
We propose a new form of software transactional memory (STM) designed to support dynamic-sized data structures, and we describe a novel non-blocking implementation. The non-blocki...
COMPGEOM
2003
ACM
13 years 9 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
SCCC
2003
IEEE
13 years 9 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
P2P
2003
IEEE
13 years 9 months ago
2003
IEEE
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
IEEEPACT
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper describes Compiler-Directed Content-Aware Prefetching (CDCAP), an integrated compiler and hardware approach for prefetching dynamic data structures. The approach utiliz...
ICRA
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
ICEIS
2003
IEEE
13 years 9 months ago
2003
IEEE
d graphically, interest in code generators which create applications based on abstract system descriptions, is high. An indicator for this are the many commercial products. This pa...
DASFAA
2003
IEEE
13 years 9 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
WIA
2004
Springer
13 years 9 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...