Sciweavers

6229 search results - page 867 / 1246
» Models of Computation for Networks on Chip
Sort
View
132
Voted
TWC
2010
14 years 7 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
95
Voted
PODC
2009
ACM
16 years 1 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
100
Voted
WWW
2008
ACM
16 years 1 months ago
Social and semantics analysis via non-negative matrix factorization
Social media such as Web forum often have dense interactions between user and content where network models are often appropriate for analysis. Joint non-negative matrix factorizat...
Zhi-Li Wu, Chi-Wa Cheng, Chun-hung Li
EWSN
2009
Springer
16 years 1 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
ICNP
2009
IEEE
15 years 7 months ago
Principles of Safe Policy Routing Dynamics
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
Sam Epstein, Karim Mattar, Ibrahim Matta