Sciweavers

478 search results - page 19 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
ICPR
2010
IEEE
14 years 11 months ago
Feature Space Hausdorff Distance for Face Recognition
We propose a novel face image similarity measure based on Hausdorff distance (HD). In contrast to conventional HD-based measures, which are generally applied in the image space (s...
Shaokang Chen, Brian Carrington Lovell
ML
2010
ACM
141views Machine Learning» more  ML 2010»
14 years 8 months ago
Relational retrieval using a combination of path-constrained random walks
Scientific literature with rich metadata can be represented as a labeled directed graph. This graph representation enables a number of scientific tasks such as ad hoc retrieval o...
Ni Lao, William W. Cohen
ESA
2010
Springer
126views Algorithms» more  ESA 2010»
14 years 10 months ago
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
Viresh Patel
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 9 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan