135views more  PR 2010»
13 years 9 days ago
Revisiting priority queues for image analysis
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queu...
Cris L. Luengo Hendriks
122views more  DM 1999»
13 years 5 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
131views more  JACM 2000»
13 years 5 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
94views more  DKE 2002»
13 years 5 months ago
Tie-breaking strategies for fast distance join processing
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
Hyoseop Shin, Bongki Moon, Sukho Lee
115views more  QUESTA 2006»
13 years 5 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia
106views Optimization» more  PE 2008»
13 years 5 months ago
Time-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time MX /D/1 priority queue. In particular, we derive an expression for the generating function of ...
Joris Walraevens, Dieter Fiems, Herwig Bruneel
13 years 7 months ago
On the Power of Structural Violations in Priority Queues
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
13 years 7 months ago
Prioritizing Bellman Backups without a Priority Queue
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
Peng Dai, Eric A. Hansen
101views Algorithms» more  SWAT 1992»
13 years 9 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
13 years 9 months ago
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
ÐWith effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating bet...
Sung-Whan Moon, Kang G. Shin, Jennifer Rexford