105 search results - page 21 / 21 » Tree Structure Compression with RePair |
SIGMOD
2000
ACM
13 years 10 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...
SSD
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
RECOMB
2002
Springer
14 years 6 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
GIS
2004
ACM
14 years 6 months ago
2004
ACM
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
CIKM
2005
Springer
13 years 11 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...