1396 search results - page 5 / 280 » Succinct Dynamic Data Structures |
TCS
2008
13 years 8 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
DASFAA
2005
IEEE
14 years 2 months ago
2005
IEEE
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
IJFCS
2008
13 years 8 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...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...