198 search results - page 2 / 40 » A Framework for Dynamizing Succinct Data Structures |
IJFCS
2008
13 years 5 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
SIGCSE
2004
ACM
13 years 10 months ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...