2254 search results - page 322 / 451 » Computing the minimal covering set |
443
click to vote
RECOMB
2011
Springer
14 years 9 months ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
186
Voted
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
162
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Detecting epistatic interactions associated with complex and common diseases can help to improve prevention, diagnosis and treatment of these diseases. With the develo...
167
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
In recent years, the blogosphere has experienced a substantial increase in the number of posts published daily, forcing users to cope with information overload. The task of guidin...
173
Voted
SRDS
2006
IEEE
16 years 3 days ago
2006
IEEE
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...