65 search results - page 4 / 13 » An Approach to Graph and Netlist Compression |
COLING
2010
13 years 2 months ago
2010
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
CPM
2004
Springer
14 years 25 days ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
TIT
2010
13 years 2 months ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...