283 search results - page 42 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
RECOMB
2004
Springer
14 years 7 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
EUROPAR
2009
Springer
14 years 4 days ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...