Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
We propose the mqr-tree, a two-dimensional spatial access method that improves upon the 2DR-tree. The 2DRtree uses two-dimensional nodes so that the relationships between all obje...
This paper presents a preliminary effort on visualization and analysis of social networks for online marketplaces. We use one of the most popular e-business models, eBay, as a cas...