Sciweavers

199 search results - page 14 / 40
» A Method for Selecting the Bin Size of a Time Histogram
Sort
View
CCE
2004
13 years 7 months ago
A decomposition method for synthesizing complex column configurations using tray-by-tray GDP models
This paper describes an optimization procedure for the synthesis of complex distillation configurations. A superstructure based on the Reversible Distillation Sequence Model (RDSM...
Mariana Barttfeld, Pío A. Aguirre, Ignacio ...
BMCBI
2010
151views more  BMCBI 2010»
13 years 7 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
ECCV
2006
Springer
14 years 9 months ago
Sampling Strategies for Bag-of-Features Image Classification
Abstract. Bag-of-features representations have recently become popular for content based image classification owing to their simplicity and good performance. They evolved from text...
Eric Nowak, Frédéric Jurie, Bill Tri...
ICML
2010
IEEE
13 years 8 months ago
Online Streaming Feature Selection
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
Xindong Wu, Kui Yu, Hao Wang, Wei Ding
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...