675 search results - page 131 / 135 » On Compression of Parse Trees |
IEEESCC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
CCP
2011
12 years 7 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
SSDBM
2003
IEEE
14 years 22 days ago
2003
IEEE
Many scientific applications generate large spatiotemporal datasets. A common way of exploring these datasets is to identify and track regions of interest. Usually these regions ...
SIGMOD
2000
ACM
13 years 11 months ago
2000
ACM
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...