Sciweavers

911 search results - page 50 / 183
» First Steps with a Rideable Computer
Sort
View
ADC
2006
Springer
136views Database» more  ADC 2006»
14 years 1 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
SIAMJO
2008
117views more  SIAMJO 2008»
13 years 7 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»
13 years 7 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
13 years 7 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...
CVPR
2001
IEEE
14 years 10 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...