Sciweavers

70 search results - page 5 / 14
» Binary (generalized) Post Correspondence Problem
Sort
View
77
Voted
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
14 years 9 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
SIGIR
2003
ACM
15 years 2 months ago
A maximal figure-of-merit learning approach to text categorization
A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integ...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
ICALP
2009
Springer
15 years 9 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
EVOW
2004
Springer
15 years 2 months ago
Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data
Abstract. We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techn...
Carlos Cotta, Christian Sloper, Pablo Moscato
62
Voted
ACRI
2004
Springer
15 years 2 months ago
Evolving Transition Rules for Multi Dimensional Cellular Automata
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
Ron Breukelaar, Thomas Bäck