2107 search results - page 301 / 422 » Computing Small Search Numbers in Linear Time |
102
click to vote
SC
2009
ACM
15 years 9 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
117
click to vote
ISMB
2000
15 years 3 months ago
2000
We have developed a set of methods and tools for automatic discovery of putative regulatory signals in genome sequences. The analysis pipeline consists of gene expression data clu...
118
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
143
Voted
ICPPW
2009
IEEE
15 years 8 days ago
2009
IEEE
Identifying peptides, which are short polymeric chains of amino acid residues in a protein sequence, is of fundamental importance in systems biology research. The most popular appr...
116
Voted
CCCG
2010
15 years 4 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...