Sciweavers

765 search results - page 48 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ECCV
2010
Springer
15 years 4 months ago
Partition Min-Hash for Partial Duplicate Image Discovery
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 3 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
INFOCOM
2006
IEEE
15 years 5 months ago
Optimal Scheduling Algorithms for Input-Queued Switches
— The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high line speeds. A central problem in designing an input-queued swit...
Devavrat Shah, Damon Wischik
TON
2010
198views more  TON 2010»
14 years 6 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
CVPR
2001
IEEE
16 years 1 months ago
A Spherical Eye from Multiple Cameras (Makes Better Models of the World)
This paper describes an imagingsystem that has been designed specifically for the purpose of recovering egomotion and structure from video. The system consists of six cameras in a...
Patrick Baker, Cornelia Fermüller, Yiannis Al...