Sciweavers

2042 search results - page 129 / 409
» Variable Number of
Sort
View
BMCBI
2011
14 years 8 months ago
To aggregate or not to aggregate high-dimensional classifiers
Background: High-throughput functional genomics technologies generate large amount of data with hundreds or thousands of measurements per sample. The number of sample is usually m...
Cheng-Jian Xu, Huub C. J. Hoefsloot, Age K. Smilde
ACSC
2009
IEEE
15 years 11 months ago
The Impact of Quanta on the Performance of Multi-level Time Sharing Policy under Heavy-tailed Workloads
Recent research indicates that modern computer workloads (e.g. processing time of web requests) follow heavy-tailed distributions. In a heavy-tailed distribution there are a large...
Malith Jayasinghe, Zahir Tari, Panlop Zeephongseku...
BMCBI
2010
135views more  BMCBI 2010»
15 years 4 months ago
Simple and flexible classification of gene expression microarrays via Swirls and Ripples
Background: A simple classification rule with few genes and parameters is desirable when applying a classification rule to new data. One popular simple classification rule, diagon...
Stuart G. Baker
SAT
2004
Springer
102views Hardware» more  SAT 2004»
15 years 9 months ago
Derandomization of Schuler's Algorithm for SAT
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
Evgeny Dantsin, Alexander Wolpert
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
16 years 1 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne