𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The amortized complexity of Henriksen's algorithm

✍ Scribed by Jeffrey H. Kingston

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
312 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The expected complexity of Prim's minimu
The expected complexity of Prim's minimum spanning tree algorithm
✍ Chip Martel πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 60 KB

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which ha

On the complexity of Rocchio's similarit
On the complexity of Rocchio's similarity-based relevance feedback algorithm
✍ Zhixiang Chen; Bin Fu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 271 KB πŸ‘ 1 views

## Abstract Rocchio's similarity‐based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive learning algorithm from examples in searching for documents represented by a linear classifier. Despite its popularity in var

A mixed evolutionary-statistical analysi
A mixed evolutionary-statistical analysis of an algorithm's complexity
✍ C. Cotta; P. Moscato πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 372 KB

A combination of evolutionary algorithms and statistical techniques is used to analyze the worst-case computational complexity of two sorting algorithms. It is shown that excellent bounds for these algorithms can be obtained using this approach; this fact raises interesting prospects for applying th