Sciweavers

3396 search results - page 126 / 680
» Tree representations of graphs
Sort
View
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
14 years 10 months ago
Engineering a Fast Online Persistent Suffix Tree Construction
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
Srikanta J. Bedathur, Jayant R. Haritsa
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
14 years 3 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
SERP
2004
13 years 10 months ago
Design and Evaluation of an Automated Aspect Mining Tool
Attention to aspect oriented programming (AOP) is rapidly growing as its benefits in large software system development and maintenance are increasingly recognized. However, existin...
David Shepherd, Emily Gibson, Lori L. Pollock
DCC
2007
IEEE
14 years 8 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
ICTAI
2006
IEEE
14 years 3 months ago
Graph Grammar Induction on Structural Data for Visual Programming
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...
Keven Ates, Jacek P. Kukluk, Lawrence B. Holder, D...