Sciweavers

463 search results - page 4 / 93
» A General Framework for Graph Sparsification
Sort
View
CSL
2008
Springer
13 years 9 months ago
On Counting Generalized Colorings
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
Tomer Kotek, Johann A. Makowsky, Boris Zilber
CIKM
2009
Springer
14 years 2 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
AOSD
2008
ACM
13 years 9 months ago
AJANA: a general framework for source-code-level interprocedural dataflow analysis of AspectJ software
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
Guoqing Xu, Atanas Rountev
ILP
1997
Springer
13 years 11 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
13 years 11 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...