Sciweavers

1381 search results - page 171 / 277
» Fast Filtered Sampling
Sort
View
83
Voted
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 4 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 2 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
90
Voted
ICMLA
2008
15 years 2 months ago
Highly Scalable SVM Modeling with Random Granulation for Spam Sender Detection
Spam sender detection based on email subject data is a complex large-scale text mining task. The dataset consists of email subject lines and the corresponding IP address of the em...
Yuchun Tang, Yuanchen He, Sven Krasser
94
Voted
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 2 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
77
Voted
JEI
2007
90views more  JEI 2007»
15 years 15 days ago
Accelerating spectral-based color separation within the Neugebauer subspace
Spectral separation is the process of obtaining printer control values to reproduce a given spectral reflectance. Given a multispectral image where each pixel represents a spectra...
Philipp Urban, Mitchell R. Rosen, Roy S. Berns