2254 search results - page 359 / 451 » Computing the minimal covering set |
153
click to vote
DATE
2009
IEEE
16 years 19 days ago
2009
IEEE
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
171
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
188
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
161
click to vote
BMCBI
2005
15 years 5 months ago
2005
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
137
click to vote
PR
2007
15 years 5 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...