Sciweavers

709 search results - page 124 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
BMCBI
2007
109views more  BMCBI 2007»
14 years 9 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 9 months ago
Local search for stable marriage problems
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ECCC
2010
124views more  ECCC 2010»
14 years 9 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
BMCBI
2006
172views more  BMCBI 2006»
14 years 9 months ago
Prediction of cis/trans isomerization in proteins using PSI-BLAST profiles and secondary structure information
Background: The majority of peptide bonds in proteins are found to occur in the trans conformation. However, for proline residues, a considerable fraction of Prolyl peptide bonds ...
Jiangning Song, Kevin Burrage, Zheng Yuan, Thomas ...
DM
2006
128views more  DM 2006»
14 years 9 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck