Sciweavers

429 search results - page 6 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
BMCBI
2006
126views more  BMCBI 2006»
14 years 9 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo
ICANN
2009
Springer
15 years 2 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
73
Voted
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
15 years 3 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
15 years 1 months ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein