2695 search results - page 382 / 539 » Learning Graph Matching |
108
click to vote
CC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
133
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
111
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
143
click to vote
NIPS
2007
15 years 4 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
217
click to vote
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Clio, the IBM Research system for expressing declarative schema mappings, has progressed in the past few years from a research prototype into a technology that is behind some of I...