97 search results - page 6 / 20 » Some graphs related to the small Mathieu groups |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
TIT
1998
13 years 8 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
SIGITE
2004
ACM
14 years 1 months ago
2004
ACM
There are efforts underway to define each of several flavors of computing disciplines, including computer science, computer engineering, information science, information technolog...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
: Network intrusion detection sensors are usually built around low level models of network traffic. This means that their output is of a similarly low level and as a consequence, ...