Sciweavers

1318 search results - page 149 / 264
» Measuring network security using dynamic bayesian network
Sort
View
CCS
2009
ACM
14 years 9 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
ICASSP
2010
IEEE
13 years 9 months ago
Improved Internet traffic analysis via optimized sampling
Applications to evaluate Internet quality-of-service and increase network security are essential to maintaining reliability and high performance in computer networks. These applic...
Sean McPherson, Antonio Ortega
WIOPT
2011
IEEE
13 years 25 days ago
LIFO-Backpressure achieves near optimal utility-delay tradeoff
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
Longbo Huang, Scott Moeller, Michael J. Neely, Bha...
SIGMOD
2010
ACM
211views Database» more  SIGMOD 2010»
14 years 2 months ago
ERACER: a database approach for statistical inference and data cleaning
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
Chris Mayfield, Jennifer Neville, Sunil Prabhakar
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
Failure recovery for structured P2P networks: protocol design and performance evaluation
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu