Sciweavers

15 search results - page 1 / 3
» Just how dense are dense graphs in the real world
Sort
View
AVI
2006
13 years 6 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
13 years 11 months ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...
ICCTA
2007
IEEE
13 years 8 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
WWW
2007
ACM
14 years 5 months ago
Extraction and classification of dense communities in the web
The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understandi...
Yon Dourisboure, Filippo Geraci, Marco Pellegrini
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
13 years 3 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...