4137 search results - page 158 / 828 » On the number of matchings of a tree |
171
click to vote
FGR
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a face verification framework for fusing matching scores that measure similarities of local facial features. The framework is aimed to handle an openset verifi...
147
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
171
click to vote
IJWET
2008
15 years 6 months ago
2008
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
147
click to vote
GI
2010
Springer
15 years 5 months ago
2010
Springer
: A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for ...
187
click to vote
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...