2695 search results - page 20 / 539 » Learning Graph Matching |
103
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...
101
click to vote
LION
2009
Springer
15 years 6 months ago
2009
Springer
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
ICML
2009
IEEE
16 years 16 days ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
103
click to vote
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
109
click to vote
IBIS
2006
14 years 11 months ago
2006
: 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 ...