1154 search results - page 65 / 231 » On the editing distance of graphs |
153
click to vote
RFIDSEC
2010
15 years 4 months ago
2010
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
176
click to vote
ICB
2007
Springer
16 years 10 days ago
2007
Springer
Local Gabor features (jets) have been widely used in face recognition systems. Once the sets of jets have been extracted from the two faces to be compared, a proper measure of simi...
142
click to vote
SAC
2009
ACM
16 years 29 days ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
160
click to vote
ADBIS
2003
Springer
15 years 11 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
212
click to vote
CVPR
2000
IEEE
15 years 10 months ago
2000
IEEE
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...