1664 search results - page 90 / 333 » Distance labeling in graphs |
128
click to vote
RFIDSEC
2010
15 years 2 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-...
142
click to vote
ICB
2007
Springer
15 years 10 months 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...
120
Voted
SAC
2009
ACM
15 years 11 months 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...
136
click to vote
ADBIS
2003
Springer
15 years 9 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...
132
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...