Sciweavers

1056 search results - page 173 / 212
» Constraint-Based Graph Matching
Sort
View
CIKM
2008
Springer
13 years 11 months ago
Efficient and effective link analysis with precomputed salsa maps
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...
Marc Najork, Nick Craswell
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 10 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
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...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
NIPS
2007
13 years 10 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
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 ...
Amir Globerson, Tommi Jaakkola
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
SIGMOD
2008
ACM
95views Database» more  SIGMOD 2008»
14 years 9 months ago
Interactive generation of integrated schemas
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa