3267 search results - page 167 / 654 » Generalized quasirandom graphs |
199
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
180
click to vote
COMPSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
Given the increasing dependence of our societies on information systems, the overall security of these systems should be measured and improved. Existing work generally focuses on ...
153
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X ...
182
click to vote
MSCS
2007
15 years 6 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
170
click to vote
MLG
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...