Sciweavers

866 search results - page 21 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
GD
2006
Springer
14 years 23 days ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
IJDAR
2006
245views more  IJDAR 2006»
13 years 9 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
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...
Christian Wolf, Jean-Michel Jolion
ICML
2006
IEEE
14 years 10 months ago
Graph model selection using maximum likelihood
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...
Adam Kalai, Ivona Bezáková, Rahul Sa...
PKDD
2005
Springer
153views Data Mining» more  PKDD 2005»
14 years 2 months ago
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston
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 ...
Marc Wörlein, Thorsten Meinl, Ingrid Fischer,...
ASUNAM
2011
IEEE
12 years 9 months ago
Content-based Modeling and Prediction of Information Dissemination
—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...
Kathy Macropol, Ambuj K. Singh