866 search results - page 21 / 174 » Algorithms for Comparing Pedigree Graphs |
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
IJDAR
2006
14 years 10 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
82
Voted
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
88
Voted
PKDD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
103
Voted
ASUNAM
2011
IEEE
13 years 10 months ago
2011
IEEE
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...