Login / Signup
A concentration bound for the longest increasing subsequence of a randomly chosen involution.
Marcos A. Kiwi
Published in:
Discret. Appl. Math. (2006)
Keyphrases
</>
randomly chosen
upper bound
pattern matching
lower bound
real time
data mining
data structure
high energy
data sets
neural network
similarity measure
worst case
error bounds