Sciweavers

458 search results - page 10 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
AUSAI
2008
Springer
13 years 10 months ago
Learning a Generative Model for Structural Representations
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
Andrea Torsello, David L. Dowe
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
SAGA
2007
Springer
14 years 2 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
LREC
2010
199views Education» more  LREC 2010»
13 years 10 months ago
A Random Graph Walk based Approach to Computing Semantic Relatedness Using Knowledge from Wikipedia
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
Ziqi Zhang, Anna Lisa Gentile, Lei Xia, José...
SOCIALCOM
2010
13 years 6 months ago
Graph Comparison Using Fine Structure Analysis
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
Owen Macindoe, Whitman Richards