Sciweavers

5316 search results - page 24 / 1064
» Which Search Problems Are Random
Sort
View
106
Voted
JMLR
2010
120views more  JMLR 2010»
14 years 7 months ago
Effective Wrapper-Filter hybridization through GRASP Schemata
Of all of the challenges which face the selection of relevant features for predictive data mining or pattern recognition modeling, the adaptation of computational intelligence tec...
Mohamed Amir Esseghir
151
Voted
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 29 days ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
112
Voted
PAMI
2008
270views more  PAMI 2008»
15 years 18 days ago
Randomized Clustering Forests for Image Classification
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
Frank Moosmann, Eric Nowak, Frédéric...
CPAIOR
2009
Springer
15 years 7 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
15 years 6 months ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf