2695 search results - page 260 / 539 » Learning Graph Matching |
134
Voted
ORDER
2006
15 years 3 months ago
2006
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
144
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
149
Voted
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
This paper addresses the problem of mining named entity translations from comparable corpora, specifically, mining English and Chinese named entity translation. We first observe...
141
Voted
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
139
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...