Sciweavers

344 search results - page 56 / 69
» Random Walks on Colored Graphs
Sort
View
MOBIHOC
2009
ACM
16 years 4 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
INFOCOM
2007
IEEE
15 years 10 months ago
On Node Isolation Under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
Zhongmei Yao, Xiaoming Wang, Derek Leonard, Dmitri...
CIKM
2010
Springer
15 years 2 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
CVPR
2012
IEEE
13 years 6 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
INFOCOM
2008
IEEE
15 years 10 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov