Sciweavers

126 search results - page 22 / 26
» On the Conditional Independence Implication Problem: A Latti...
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Castor: Scalable Secure Routing for Ad Hoc Networks
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
Wojciech Galuba, Panos Papadimitratos, Marcin Potu...
COMCOM
2006
154views more  COMCOM 2006»
13 years 7 months ago
Minimum-cost network hardening using attack graphs
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
Lingyu Wang, Steven Noel, Sushil Jajodia
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
SADM
2010
141views more  SADM 2010»
13 years 2 months ago
A parametric mixture model for clustering multivariate binary data
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
Ajit C. Tamhane, Dingxi Qiu, Bruce E. Ankenman
CORR
2010
Springer
261views Education» more  CORR 2010»
13 years 5 months ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca