✦ LIBER ✦

Revisiting priority queues for image analysis

✍ Scribed by Cris L. Luengo Hendriks

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 445 KB
Volume: 43
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2010.04.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance analysis of the priority que

Performance analysis of the priority queues for the load-building algorithms

✍ Anna Hać 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 682 KB

Randomized Priority Queues for Fast Para

Randomized Priority Queues for Fast Parallel Access

✍ Peter Sanders 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Level crossing analysis of priority queu

Level crossing analysis of priority queues and a conservation identity for vacation models

✍ J. George Shanthikumar 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

Analysis of a finite capacity non preemp

Analysis of a finite capacity non preemptive priority queue

✍ Asha Seth Kapadia; Mohammad Fasihullah Kazmi; A.Cameron Mitchell 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Waiting-time distributions for queues wi

Waiting-time distributions for queues with dynamic priorities

✍ James R. Jackson 📂 Article 📅 1962 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

An efficient algorithm for concurrent pr

An efficient algorithm for concurrent priority queue heaps

✍ Galen C. Hunt; Maged M. Michael; Srinivasan Parthasarathy; Michael L. Scott 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 628 KB

We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to , but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to