2695 search results - page 85 / 539 » Learning Graph Matching |
118
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
120
click to vote
IMECS
2007
15 years 3 months ago
2007
The benefit of incorporating background knowledge in the learning process has been successfully demonstrated in numerous applications of ILP methods. Nevertheless the effect of inc...
ALT
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
118
click to vote
ICPR
2004
IEEE
16 years 3 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
103
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...