4759 search results - page 160 / 952 » Parallelizing the Phylogeny Problem |
SIAMSC
2010
13 years 6 months ago
2010
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of ...
CIAC
2000
Springer
14 years 15 days ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
BMCBI
2008
13 years 8 months ago
2008
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
STOC
1999
ACM
14 years 13 days ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
BMVC
2000
13 years 9 months ago
2000
We tackle the problem of object recognition using a Bayesian approach. A marked point process [1] is used as a prior model for the (unknown number of) objects. A sample is generat...