Sciweavers

167 search results - page 2 / 34
» Adaptive Searching in One and Two Dimensions
Sort
View
GECCO
2009
Springer
153views Optimization» more  GECCO 2009»
13 years 10 months ago
Benchmarking the (1+1) evolution strategy with one-fifth success rule on the BBOB-2009 function testbed
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
Anne Auger
AAAI
2012
11 years 7 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
GECCO
2003
Springer
268views Optimization» more  GECCO 2003»
13 years 10 months ago
A Generalized Feedforward Neural Network Architecture and Its Training Using Two Stochastic Search Methods
Shunting Inhibitory Artificial Neural Networks (SIANNs) are biologically inspired networks in which the synaptic interactions are mediated via a nonlinear mechanism called shuntin...
Abdesselam Bouzerdoum, Rainer Mueller
ICCV
2003
IEEE
14 years 7 months ago
Mean Shift Based Clustering in High Dimensions: A Texture Classification Example
Feature space analysis is the main module in many computer vision tasks. The most popular technique, k-means clustering, however, has two inherent limitations: the clusters are co...
Bogdan Georgescu, Ilan Shimshoni, Peter Meer
APCCAS
2006
IEEE
233views Hardware» more  APCCAS 2006»
13 years 11 months ago
Flexible Filter Bank Dimensioning for Multicarrier Modulation and Frequency Domain Equalization
— This paper investigates both transmultiplexer (TMUX) and analysis-synthesis filter banks where the two sides of the filter bank system are of different sizes. Such configura...
Ari Viholainen, Tero Ihalainen, Tobias Hidalgo Sti...