Sciweavers

1664 search results - page 122 / 333
» Distance labeling in graphs
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
CVPR
2009
IEEE
16 years 11 months ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert
ISCI
2007
96views more  ISCI 2007»
15 years 4 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
IBIS
2006
109views more  IBIS 2006»
15 years 4 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
ICPR
2008
IEEE
15 years 11 months ago
Alternative similarity functions for graph kernels
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
Jérôme Kunegis, Andreas Lommatzsch, C...