2313 search results - page 411 / 463 » On Heuristic Time Hierarchies |
140
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The heterokonts are a particularly interesting group of eukaryotic organisms; they include many key species of planktonic and coastal algae and several important patho...
176
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
177
click to vote
CGF
2006
15 years 6 months ago
2006
We describe a compressed multiresolution representation for supporting interactive rendering of very large planar and spherical terrain surfaces. The technique, called Compressed ...
139
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Molecular biologists need sophisticated analytical tools which often demand extensive computational resources. While finding, installing, and using these tools can be ...
157
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...