Sciweavers

3663 search results - page 504 / 733
» Problems in the ontology of computer programs
Sort
View
DM
2006
128views more  DM 2006»
15 years 6 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
WABI
2010
Springer
128views Bioinformatics» more  WABI 2010»
15 years 5 months ago
Sparsification of RNA Structure Prediction Including Pseudoknots
Background: Although many RNA molecules contain pseudoknots, computational prediction of pseudoknotted RNA structure is still in its infancy due to high running time and space con...
Mathias Möhl, Raheleh Salari, Sebastian Will,...
CVPR
2009
IEEE
17 years 1 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
RECOMB
2010
Springer
16 years 1 months ago
On the Genealogy of Asexual Diploids
Given molecular genetic data from diploid individuals that, at present, reproduce mostly or exclusively asexually without recombination, an important problem in evolutionary biolog...
Fumei Lam, Charles H. Langley, Yun S. Song
FOSSACS
2007
Springer
16 years 23 days ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong