2503 search results - page 274 / 501 » A study of 3-arc graphs |
176
click to vote
DBSEC
2009
15 years 7 months ago
2009
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
188
click to vote
CN
2008
15 years 6 months ago
2008
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
130
click to vote
IPL
2008
15 years 6 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
158
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...