Results 1  10
of
12,797
Average Complexity of
 Theoretical Computer Science
, 2004
"... We show that the average number of characters examined to search for r random patterns of length m in a text of length n over a uniformly distributed alphabet of size # cannot be less than# n log # (rm)/m). When we permit up to k insertions, deletions, and/or substitutions of characters in the o ..."
Abstract
 Add to MetaCart
We show that the average number of characters examined to search for r random patterns of length m in a text of length n over a uniformly distributed alphabet of size # cannot be less than# n log # (rm)/m). When we permit up to k insertions, deletions, and/or substitutions of characters
Average Complexity
"... Imperfectness for word error rate of 10 –4. The (2,1,14) code with g (1) =56721, g (2) =61713 ..."
Abstract
 Add to MetaCart
Imperfectness for word error rate of 10 –4. The (2,1,14) code with g (1) =56721, g (2) =61713
On the average complexity of some . . .
, 1981
"... Consider n independent uniform (0,l) random variables, and let N,,..., N. be the cardinalities of the intervals [(i 1)/n), (i/n)], 1 d i I II. Then B(rqax IV,) (Iog n/log log q) as n + =. This result (proved in the paper) and related results about the asymptotical behavior of E(g(mgx No) for incr ..."
Abstract
 Add to MetaCart
) for increasing functions g allow us to draw some conclusions about the average complexity of some bucketing algorithms in computational geometry. We illustrate this point by showing that Shamos ’ unpublished bucketing algorithm for finding the convex hull of R independent identically distributed random vectors X
On the Average Complexity for the Verification of Compatible Sequences
, 2011
"... The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use o ..."
Abstract
 Add to MetaCart
The average complexity analysis for a formalism pertaining pairs of compatible sequences is presented. The analysis is done in two levels, so that an accurate estimate is achieved. The way of separating the candidate pairs into suitable classes of ternary sequences is interesting, allowing the use
KLEE: Unassisted and Automatic Generation of HighCoverage Tests for Complex Systems Programs
"... We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form the cor ..."
Abstract

Cited by 557 (15 self)
 Add to MetaCart
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentallyintensive programs. We used KLEE to thoroughly check all 89 standalone programs in the GNU COREUTILS utility suite, which form
AVERAGE COMPLEXITIES OF ACCESS STRUCTURES ON FIVE PARTICIPANTS
"... (Communicated by Douglas Stinson) Abstract. In this paper, we consider the 12 access structures on five participants for which determining the exact values of the average complexities remained as open problems in Jackson and Martin’s paper [6]. We establish the exact values of the average complexiti ..."
Abstract
 Add to MetaCart
(Communicated by Douglas Stinson) Abstract. In this paper, we consider the 12 access structures on five participants for which determining the exact values of the average complexities remained as open problems in Jackson and Martin’s paper [6]. We establish the exact values of the average
ON THE AVERAGE COMPLEXITY OF MOORE’S STATE MINIMIZATION ALGORITHM
, 2009
"... We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). Moreover this bound is tight in the case of unary automata. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moore’s state minimization algorithm is in O(nlog n). Moreover this bound is tight in the case of unary automata.
A note on the average complexity analysis of the computation of . . .
 J. COMBIN. THEORY SER. A
, 2010
"... We give an average complexity analysis for a new formalism pertaining periodic and aperiodic ternary complementary pairs. The analysis is done in three levels, so that we end up with an accurate estimate. The way of separating the candidate pairs into suitable classes of ternary sequences is interes ..."
Abstract
 Add to MetaCart
We give an average complexity analysis for a new formalism pertaining periodic and aperiodic ternary complementary pairs. The analysis is done in three levels, so that we end up with an accurate estimate. The way of separating the candidate pairs into suitable classes of ternary sequences
Epidemic Spreading in ScaleFree Networks
, 2000
"... The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from c ..."
Abstract

Cited by 575 (15 self)
 Add to MetaCart
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scalefree networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from
Results 1  10
of
12,797