Sciweavers

5606 search results - page 334 / 1122
» Randomization Techniques for Graphs.
Sort
View
BMCBI
2008
169views more  BMCBI 2008»
15 years 6 months ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...
INFOCOM
2010
IEEE
15 years 5 months ago
Optimal SINR-based Random Access
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
Amir Hamed Mohsenian Rad, Vincent W. S. Wong, Robe...
EDM
2009
116views Data Mining» more  EDM 2009»
15 years 4 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
DAC
2003
ACM
16 years 7 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
POPL
2003
ACM
16 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula