9209 search results - page 391 / 1842 » Data Space Randomization |
195
click to vote
DASFAA
2006
IEEE
16 years 26 days ago
2006
IEEE
There is much interest in the processing of data streams for applications in the fields such as financial analysis, network monitoring, mobile services, and sensor network manage...
160
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
221
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
174
click to vote
CPM
1999
Springer
15 years 11 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...
153
click to vote
SAC
2006
ACM
16 years 22 days ago
2006
ACM
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...