Sciweavers

73 search results - page 5 / 15
» Random Walk on Directed Dynamic Graphs
Sort
View
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 3 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
SIGCOMM
2010
ACM
13 years 9 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...
ICML
2006
IEEE
14 years 10 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
ICRA
2009
IEEE
155views Robotics» more  ICRA 2009»
14 years 4 months ago
Monte Carlo simultaneous localization of multiple unknown transient radio sources using a mobile robot with a directional antenn
— We report our system and algorithm developments that enable a single mobile robot equipped with a directional antenna to simultaneously localize multiple unknown transient radi...
Dezhen Song, Chang-Young Kim, Jingang Yi
ALT
2010
Springer
13 years 4 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...