2695 search results - page 112 / 539 » Learning Graph Matching |
130
click to vote
MLG
2007
Springer
15 years 8 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
139
Voted
PODS
1993
ACM
15 years 6 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
129
click to vote
ISVC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we present a novel graph, sub-graph and supergraph based face representation which captures the facial shape changes and deformations caused due to pose ch...
118
Voted
CIE
2007
Springer
15 years 8 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
166
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Face representations based on Gabor features have achieved great success in face recognition, such as Elastic Graph Matching, Gabor Fisher Classifier (GFC), and AdaBoosted Gabor F...