Sciweavers

3514 search results - page 51 / 703
» A search space
Sort
View
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 7 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
IUI
1999
ACM
14 years 1 months ago
Opportunistic Exploration of Large Consumer Product Spaces
The advent of the Web has brought an unprecedented amount of information together with a large, diverse set of users. Online users are performing a wider variety of tasks than eve...
Doug Bryan, Anatole Gershman
VLDB
2000
ACM
114views Database» more  VLDB 2000»
14 years 14 days ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1)-ES with one-fifth success rule on the BBOB-2009 noisy testbed
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
Anne Auger
PPSN
1994
Springer
14 years 1 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph