2542 search results - page 471 / 509 » Computing Cartograms with Optimal Complexity |
IJCAI
1997
13 years 10 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
BMCBI
2006
13 years 9 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 ...
CN
2007
13 years 8 months ago
2007
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
JACM
2006
13 years 8 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
BMCBI
2005
13 years 8 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...