Sciweavers

73 search results - page 14 / 15
» Random Walk on Directed Dynamic Graphs
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 11 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
PVLDB
2010
220views more  PVLDB 2010»
13 years 16 days ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 5 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
CVPR
2005
IEEE
14 years 7 months ago
Bayesian Object Detection in Dynamic Scenes
Detecting moving objects using stationary cameras is an important precursor to many activity recognition, object recognition and tracking algorithms. In this paper, three innovati...
Yaser Sheikh, Mubarak Shah
IPPS
2010
IEEE
13 years 3 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke