5889 search results - page 476 / 1178 » Graph Layout Problems |
216
click to vote
ICIAP
1999
ACM
15 years 12 months ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
180
click to vote
IPCO
2007
15 years 9 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
219
click to vote
SIAMSC
2008
15 years 7 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
200
click to vote
EMNLP
2010
15 years 5 months ago
2010
This paper studies the problem of mining entity translation, specifically, mining English and Chinese name pairs. Existing efforts can be categorized into (a) a transliterationbas...
205
click to vote
CVPR
2011
IEEE
15 years 4 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...