Sciweavers

867 search results - page 73 / 174
» Network Robustness and Graph Topology
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Recovering temporally rewiring networks: a model-based approach
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...
Fan Guo, Steve Hanneke, Wenjie Fu, Eric P. Xing
DAIS
2011
12 years 11 months ago
Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
John Ardelius, Boris Mejías
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
14 years 2 months ago
Local Probabilistic Models for Link Prediction
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented ...
Chao Wang, Venu Satuluri, Srinivasan Parthasarathy
COCOA
2009
Springer
14 years 2 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...
GD
2004
Springer
14 years 1 months ago
Distributed Graph Layout for Sensor Networks
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
Craig Gotsman, Yehuda Koren