8 search results - page 2 / 2 » Clustering via Random Walk Hitting Time on Directed Graphs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
CC
2008
Springer
13 years 4 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
TMM
2010
12 years 11 months ago
2010
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...