63 search results - page 5 / 13 » Transparent pointer compression for linked data structures |
83
Voted
DCC
2000
IEEE
15 years 1 months ago
2000
IEEE
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
65
Voted
USENIX
1994
14 years 10 months ago
1994
Concert/C is a new language for distributed C programming that extends ANSI C to support distribution and process dynamics. Concert/C provides the ability to create and terminate ...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
87
Voted
PLDI
1999
ACM
15 years 1 months ago
1999
ACM
Hardware trends have produced an increasing disparity between processor speeds and memory access times. While a variety of techniques for tolerating or reducing memory latency hav...
94
Voted
FUN
2010
Springer
15 years 25 days ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...