Sciweavers

911 search results - page 50 / 183
» First Steps with a Rideable Computer
Sort
View
121
Voted
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 8 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
126
Voted
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 1 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 1 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
SAC
2006
ACM
15 years 1 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
152
Voted
CVPR
2001
IEEE
16 years 3 months ago
Feature Reduction and Hierarchy of Classifiers for Fast Object Detection in Video Images
We present a two-step method to speed-up object detection systems in computer vision that use Support Vector Machines (SVMs) as classifiers. In a first step we perform feature red...
Bernd Heisele, Thomas Serre, Sayan Mukherjee, Toma...