Sciweavers

6506 search results - page 749 / 1302
» Algorithmic models for sensor networks
Sort
View
BMCBI
2007
105views more  BMCBI 2007»
15 years 7 months ago
Generating confidence intervals on biological networks
Background: In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interact...
Thomas Thorne, Michael P. H. Stumpf
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
16 years 2 days ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
JSAC
2006
199views more  JSAC 2006»
15 years 7 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith
DMIN
2009
222views Data Mining» more  DMIN 2009»
15 years 5 months ago
P-Sensitive K-Anonymity for Social Networks
-- The proliferation of social networks, where individuals share private information, has caused, in the last few years, a growth in the volume of sensitive data being stored in th...
Roy Ford, Traian Marius Truta, Alina Campan
DAC
2006
ACM
16 years 1 months ago
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip
A novel routing algorithm, namely dynamic XY (DyXY) routing, is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. ...
Ming Li, Qing-An Zeng, Wen-Ben Jone