Sciweavers

1067 search results - page 93 / 214
» Probabilistic regular graphs
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 2 months ago
Counting Claw-Free Cubic Graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are used to derive a second order, linear homogeneous differential equation with polyno...
Edgar M. Palmer, Ronald C. Read, Robert W. Robinso...
ACL
2010
15 years 1 months ago
Cross-Lingual Latent Topic Extraction
Probabilistic latent topic models have recently enjoyed much success in extracting and analyzing latent topics in text in an unsupervised way. One common deficiency of existing to...
Duo Zhang, Qiaozhu Mei, ChengXiang Zhai
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 8 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
COMPSAC
2008
IEEE
15 years 9 months ago
Measuring Network Security Using Bayesian Network-Based Attack Graphs
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 ...
Marcel Frigault, Lingyu Wang
ICML
2009
IEEE
16 years 3 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang