323 search results - page 18 / 65 » An Importance Sampling Algorithm Based on Evidence Pre-propa... |
BMCBI
2006
13 years 7 months ago
2006
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
DATAMINE
2006
13 years 7 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
UAI
2004
13 years 8 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
PPSN
2004
Springer
14 years 25 days ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...