Sciweavers

1041 search results - page 162 / 209
» Randomizing Reductions of Search Problems
Sort
View
PR
2006
229views more  PR 2006»
13 years 7 months ago
FS_SFS: A novel feature selection method for support vector machines
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
Yi Liu, Yuan F. Zheng
ICML
2004
IEEE
14 years 8 months ago
Generative modeling for continuous non-linearly embedded visual inference
Many difficult visual perception problems, like 3D human motion estimation, can be formulated in terms of inference using complex generative models, defined over high-dimensional ...
Cristian Sminchisescu, Allan D. Jepson
WWW
2004
ACM
14 years 8 months ago
Distributed ranking over peer-to-peer networks
Query flooding is a problem existing in Peer-to-Peer networks like Gnutella. Firework Query Model solves this problem by Peer Clustering and routes the query message more intellig...
Dexter Chi Wai Siu, Tak Pang Lau
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
13 years 11 months ago
A mono surrogate for multiobjective optimization
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
FOCS
2007
IEEE
14 years 2 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova