Sciweavers

3257 search results - page 189 / 652
» Some Results on Effective Randomness
Sort
View
CCS
2010
ACM
14 years 11 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
BMCBI
2007
154views more  BMCBI 2007»
14 years 10 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
88
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
Minas Gjoka, Maciej Kurant, Carter T. Butts, Athin...
130
Voted
BMCBI
2004
323views more  BMCBI 2004»
14 years 10 months ago
Biochemical Network Stochastic Simulator (BioNetS): software for stochastic modeling of biochemical networks
Background: Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true ...
David Adalsteinsson, David McMillen, Timothy C. El...
100
Voted
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 8 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu