1056 search results - page 67 / 212 » Constraint-Based Graph Matching |
100
Voted
APPML
2011
14 years 7 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
131
click to vote
PVLDB
2008
14 years 11 months ago
2008
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
101
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we propose a novel image similarity learning approach based on Probabilistic Feature Matching (PFM). We consider the matching process as the bipartite graph matchin...
107
click to vote
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
117
click to vote
SAGT
2009
Springer
15 years 7 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...