Login / Signup
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.
Julien Clément
Thu Hien Nguyen Thi
Brigitte Vallée
Published in:
STACS (2013)
Keyphrases
</>
computational complexity
information retrieval
computational cost
orders of magnitude
machine learning
learning algorithm
data structure
general purpose
markov random field
theoretical analysis
times faster
case study
data mining techniques
computational efficiency
realistic scenarios