Sciweavers

2304 search results - page 44 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICCV
2007
IEEE
14 years 11 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Patterns of Cascading Behavior in Large Blog Graphs
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we ...
Jure Leskovec, Mary McGlohon, Christos Faloutsos, ...
INFOCOM
2006
IEEE
14 years 3 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
EDBT
2008
ACM
177views Database» more  EDBT 2008»
14 years 9 months ago
Fast computing reachability labelings for large graphs with high compression rate
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...