17789 search results - page 3279 / 3558 » Exceptional Use Cases |
148
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
167
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
169
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Microarray experiments examine the change in transcript levels of tens of thousands of genes simultaneously. To derive meaningful data, biologists investigate the resp...
188
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...
180
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...