Sciweavers

429 search results - page 34 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 8 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ISPAN
1997
IEEE
15 years 8 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
15 years 11 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
IPPS
2007
IEEE
15 years 10 months ago
Protein Secondary Structure Prediction using Bayesian Inference method on Decision fusion algorithms
Prediction of protein secondary structure (alpha-helix, beta-sheet, coil) from primary sequence of amino acids is a very challenging task, and the problem has been approached from...
Somasheker Akkaladevi, Ajay K. Katangur
APBC
2004
132views Bioinformatics» more  APBC 2004»
15 years 5 months ago
A Novel Feature Selection Method to Improve Classification of Gene Expression Data
This paper introduces a novel method for minimum number of gene (feature) selection for a classification problem based on gene expression data with an objective function to maximi...
Liang Goh, Qun Song, Nikola K. Kasabov