Sciweavers

4759 search results - page 943 / 952
» Parallelizing the Phylogeny Problem
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
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 ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
JCB
2006
215views more  JCB 2006»
13 years 7 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...
JSW
2008
101views more  JSW 2008»
13 years 7 months ago
Graphical Mission Specification and Partitioning for Unmanned Underwater Vehicles
- The use of Unmanned Underwater Vehicles (UUVs) has been proposed for several different types of applications including hydrographic surveys (e.g., mapping the ocean floor and exp...
Gary Giger, Mahmut T. Kandemir, John Dzielski
ESWA
2007
127views more  ESWA 2007»
13 years 7 months ago
Clustering support vector machines for protein local structure prediction
Understanding the sequence-to-structure relationship is a central task in bioinformatics research. Adequate knowledge about this relationship can potentially improve accuracy for ...
Wei Zhong, Jieyue He, Robert W. Harrison, Phang C....
SP
2008
IEEE
138views Security Privacy» more  SP 2008»
13 years 7 months ago
A performance tuning methodology with compiler support
We have developed an environment, based upon robust, existing, open source software, for tuning applications written using MPI, OpenMP or both. The goal of this effort, which inte...
Oscar Hernandez, Barbara M. Chapman, Haoqiang Jin