Sciweavers

767 search results - page 87 / 154
» On Clustering Using Random Walks
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
WWW
2005
ACM
14 years 8 months ago
BackRank: an alternative for PageRank?
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
Mohamed Bouklit, Fabien Mathieu
TIT
2010
146views Education» more  TIT 2010»
13 years 2 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
DKE
2002
137views more  DKE 2002»
13 years 7 months ago
Reasoning for Web document associations and its applications in site map construction
Recently, there is an interest in using associations between web pages in providing users with pages relevant to what they are currently viewing. We believe that, to enable intell...
K. Selçuk Candan, Wen-Syan Li
ICPR
2008
IEEE
14 years 2 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang