Sciweavers

EMMCVPR
2011
Springer
12 years 4 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
QUESTA
2007
88views more  QUESTA 2007»
13 years 4 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
PAMI
2002
154views more  PAMI 2002»
13 years 4 months ago
A Comparison of Algorithms for Connected Set Openings and Closings
Arnold Meijster, Michael H. F. Wilkinson
COMPUTING
2008
94views more  COMPUTING 2008»
13 years 4 months ago
Two new methods for constructing double-ended priority queues from priority queues
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
INFOCOM
2000
IEEE
13 years 9 months ago
Fast and Scalable Priority Queue Architecture for High-Speed Network Switches
-In this paper, we present a fast and scalable pipelined priority queue architecture for use in high-performance switches with support for fine-grained quality of service (QoS) gu...
Ranjita Bhagwan, Bill Lin
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
13 years 10 months ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
SPAA
2004
ACM
13 years 10 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
INFOCOM
2007
IEEE
13 years 11 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
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
13 years 11 months ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch
ICFP
2001
ACM
14 years 4 months ago
A Simple Implementation Technique for Priority Search Queues
This paper presents a new implementation technique for priority search queues. This abstract data type is an amazing blend of finite maps and priority queues. Our implementation s...
Ralf Hinze