Sciweavers

16 search results - page 2 / 4
» Fast Meldable Priority Queues
Sort
View
INFOCOM
2007
IEEE
15 years 3 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin
SIGMETRICS
1997
ACM
153views Hardware» more  SIGMETRICS 1997»
15 years 1 months ago
Queue Management for Explicit Rate Based Congestion Control
Rate based congestion control has been considered desirable, both to deal with the high bandwidth-delay products of today's high speed networks, and to match the needs of eme...
Qingming Ma, K. K. Ramakrishnan
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
14 years 9 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
ICDAR
2003
IEEE
15 years 2 months ago
Fast Lexicon-Based Word Recognition in Noisy Index Card Images
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
Simon M. Lucas, Gregory Patoulas, Andy C. Downton