Sciweavers

1420 search results - page 80 / 284
» Representation of Graphs by OBDDs
Sort
View
PLDI
2004
ACM
15 years 11 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta
SCAM
2003
IEEE
15 years 11 months ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood
OOPSLA
1999
Springer
15 years 10 months ago
The Generic Graph Component Library
In this paper we present the Generic Graph Component Library (GGCL), a generic programming framework for graph data structures and graph algorithms. Following the theme of the Sta...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
FLAIRS
2008
15 years 8 months ago
Incorporating Latent Semantic Indexing into Spectral Graph Transducer for Text Classification
Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph re...
Xinyu Dai, Baoming Tian, Junsheng Zhou, Jiajun Che...
ICCS
1999
Springer
15 years 10 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille