Sciweavers

1722 search results - page 17 / 345
» On the sample mean of graphs
Sort
View
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
14 years 10 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
15 years 10 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
CVPR
2009
IEEE
16 years 5 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
CVPR
2009
IEEE
15 years 4 months ago
Trajectory parsing by cluster sampling in spatio-temporal graph
The objective of this paper is to parse object trajectories in surveillance video against occlusion, interruption, and background clutter. We present a spatio-temporal graph (ST-G...
Xiaobai Liu, Liang Lin, Song Chun Zhu, Hai Jin
INFOCOM
2006
IEEE
15 years 4 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...