A Tight Lower Bound for Decrease-Key in the Pure Heap Model.
John IaconoÖzgür ÖzkanPublished in: CoRR (2014)
Keyphrases
- lower bound
- objective function
- upper bound
- probabilistic model
- mathematical model
- prior knowledge
- theoretical framework
- computational model
- branch and bound
- search space
- machine learning
- probability distribution
- optimization model
- linear regression
- process model
- theoretical analysis
- worst case
- least squares
- cost function
- multi agent systems
- similarity measure
- learning algorithm
- information retrieval