Sciweavers

200 search results - page 13 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View
ICTAI
2008
IEEE
14 years 1 months ago
Discovering Program's Behavioral Patterns by Inferring Graph-Grammars from Execution Traces
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
Chunying Zhao, Keven Ates, Jun Kong, Kang Zhang
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
13 years 5 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
SIGMOD
2008
ACM
167views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient lineage tracking for scientific workflows
Data lineage and data provenance are key to the management of scientific data. Not knowing the exact provenance and processing pipeline used to produce a derived data set often re...
Thomas Heinis, Gustavo Alonso
AOSD
2007
ACM
13 years 11 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
JMLR
2008
120views more  JMLR 2008»
13 years 7 months ago
Causal Reasoning with Ancestral Graphs
Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distr...
Jiji Zhang