Sciweavers

11 search results - page 1 / 3
» Characterizing continuous time random walks on time varying ...
Sort
View
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 7 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...
MSWIM
2006
ACM
13 years 10 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
INFOCOM
2009
IEEE
13 years 11 months ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
SDM
2009
SIAM
291views Data Mining» more  SDM 2009»
14 years 2 months ago
Detection and Characterization of Anomalies in Multivariate Time Series.
Anomaly detection in multivariate time series is an important data mining task with applications to ecosystem modeling, network traffic monitoring, medical diagnosis, and other d...
Christopher Potter, Haibin Cheng, Pang-Ning Tan, S...
PAMI
2007
196views more  PAMI 2007»
13 years 4 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock