Sciweavers

1722 search results - page 11 / 345
» On the sample mean of graphs
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
Efficient mean shift belief propagation for vision tracking
A mechanism for efficient mean-shift belief propagation (MSBP) is introduced. The novelty of our work is to use mean-shift to perform nonparametric mode-seeking on belief surfaces...
Minwoo Park, Yanxi Liu, Robert T. Collins
FGR
2004
IEEE
185views Biometrics» more  FGR 2004»
15 years 1 months ago
Real Time Hand Tracking by Combining Particle Filtering and Mean Shift
Particle filter and mean shift are two successful approaches taken in the pursuit of robust tracking. Both of them have their respective strengths and weaknesses. In this paper, w...
Caifeng Shan, Yucheng Wei, Tieniu Tan, Fréd...
CORR
2011
Springer
217views Education» more  CORR 2011»
14 years 1 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
SIGCOMM
2010
ACM
14 years 10 months ago
Unbiased sampling in directed social graph
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang