Sciweavers

242 search results - page 14 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
15 years 6 months ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
SIMULATION
2011
14 years 6 months ago
The Activity-tracking paradigm in discrete-event modeling and simulation: The case of spatially continuous distributed systems
From a modelling and simulation perspective, studying dynamic systems consists of focusing on changes in states. According to the precision of state changes, generic algorithms ca...
Alexandre Muzy, Rajanikanth Jammalamadaka, Bernard...
NIPS
2008
15 years 1 months ago
Non-stationary dynamic Bayesian networks
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
Joshua W. Robinson, Alexander J. Hartemink
SIGCOMM
1997
ACM
15 years 3 months ago
End-to-end Internet Packet Dynamics
We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20,000 TCP bulk transfers between 35 Internet sites. Because we traced each 100 Kbyt...
Vern Paxson
DKE
2007
130views more  DKE 2007»
14 years 11 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan