Average case complexity analysis of RETE pattern-match algorithm and average size of join in databases

Le pro- fil évolue selon une approche statistique basée d’une part, sur la distribution des termes dans les documents jugés explicitement ou implicitement perti- nents et d’autre

In this paper, we use results on the average number of minimal transversals in random hypergraphs to show that the base of proper premises is, on average, of quasi-polynomial

Knuth [5] shows ( n 5/3 ) for the average-case of p = 2 passes and Yao [14] derives an expression for the average case for p = 3 that does not give a direct bound but was used by

For every p-pass Shellsort algorithm and every increment sequence, every subset of n!/2 n input permutations of n keys contains an input permutation that uses ⍀ ( pn 1⫹(1⫺⑀)/p

Lorsqu’un écrit scientifique issu d’une activité de recherche financée au moins pour moitié par des dotations de l’État, des collectivités territoriales ou des

There exists a positive real constant C such that for any positive integer n and any deterministic and complete transition structure T of size n over a k-letter alphabet, for

There exists a positive real constant C such that for any positive integer n and any deterministic complete transition structure T of size n over a k-letters alphabet, for the

Our analy- sis is based on studying the average in addition to the worst case, and the spirit of our results is the following: given a not too coherent dictionary and signals