Sciweavers

1056 search results - page 121 / 212
» Constraint-Based Graph Matching
Sort
View
CIVR
2008
Springer
279views Image Analysis» more  CIVR 2008»
15 years 8 months ago
Semi-supervised learning of object categories from paired local features
This paper presents a semi-supervised learning (SSL) approach to find similarities of images using statistics of local matches. SSL algorithms are well known for leveraging a larg...
Wen Wu, Jie Yang
ESWS
2005
Springer
16 years 6 days ago
Web Explanations for Semantic Heterogeneity Discovery
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....
Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro ...
ICALP
2009
Springer
16 years 7 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
SIGCOMM
2006
ACM
16 years 18 days ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
JAL
2006
114views more  JAL 2006»
15 years 6 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...