712 search results - page 73 / 143 » The Complexity of Constructing Evolutionary Trees Using Expe... |
145
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
127
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
Users of topic modeling methods often have knowledge about the composition of words that should have high or low probability in various topics. We incorporate such domain knowledg...
129
click to vote
SBBD
2007
15 years 4 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
151
click to vote
IWMMDBMS
1998
15 years 4 months ago
1998
: In recent years the fusion of multimedia information from multiple real-time sources and databases has become increasingly important because of its practical significance in many...
150
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...