449 search results - page 8 / 90 » Measuring the Similarity of Geometric Graphs |
ETRA
2010
ACM
13 years 5 months ago
2010
ACM
A great need exists in many fields of eye-tracking research for a robust and general method for scanpath comparisons. Current measures either quantize scanpaths in space (string e...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Distance metric is widely used in similarity estimation. In this paper we find that the most popular Euclidean and Manhattan distance may not be suitable for all data distribution...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
BPM
2006
Springer
13 years 11 months ago
2006
Springer
Mining, discovering, and integrating process-oriented services has attracted growing attention in the recent year. Workflow precedence graph and workflow block structures are two i...
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...