A Lower Bound on the Sample Size needed to perform a Significant Frequent Pattern Mining Task

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

In this paper, we proposes the ClosedPattern global constraint to capture the closed frequent pattern mining problem without requiring reified constraints or extra variables..

Ilias, Immersions minimales, premiere valeur propre du Lapla- cien et volume conforme, Mathematische Annalen, 275(1986), 257-267; Une ine- galit´e du type ”Reilly” pour

Thus, in order to prove a result of convergence to the equilibrium with a quantitative rate of convergence, one of the steps in [3] consists in expressing how much the domain

Réversible automata form a natural class of automata with links to artificial intelligence [1], and to biprefix codes [4], Moreover réversible automata are used to study

In this note, we prove a sharp lower bound for the log canonical threshold of a plurisubharmonic function ϕ with an isolated singularity at 0 in an open subset of C n.. The

It is essentially a local version of Tian’s invariant, which determines a sufficient condition for the existence of Kähler-Einstein metrics....

It remarkably replaced the class of Riesz transforms by more general classes of kernel operators obeying a certain point separation criterion for their Fourier multiplier symbols..