Sciweavers

301 search results - page 8 / 61
» On Finding Dense Subgraphs
Sort
View
JCT
2008
70views more  JCT 2008»
14 years 9 months ago
The number of possibilities for random dating
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
Aaron Abrams, Rod Canfield, Andrew Granville
CVPR
2008
IEEE
15 years 11 months ago
Dense correspondence finding for parametrization-free animation reconstruction from video
We present a dense 3D correspondence finding method that enables spatio-temporally coherent reconstruction of surface animations from multi-view video data. Given as input a seque...
Naveed Ahmed, Christian Theobalt, Christian Rö...
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
15 years 11 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
APVIS
2007
14 years 11 months ago
Visualisation and analysis of the internet movie database
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...
Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-He...