2229 search results - page 33 / 446 » Comparative analysis of biclustering algorithms |
152
click to vote
CSC
2009
15 years 4 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
105
click to vote
SIGMETRICS
1987
ACM
15 years 6 months ago
1987
ACM
Expressions are found for the throughput and delay performance of a Tree Conflict Resolution Algorithm that is used in a Local Area Network with carrier sensing (and possibly also ...
108
click to vote
BMCBI
2005
15 years 3 months ago
2005
Background: Different classes of haplotype block algorithms exist and the ideal dataset to assess their performance would be to comprehensively re-sequence a large genomic region ...
107
click to vote
MOC
1998
15 years 2 months ago
1998
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
164
Voted
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...