Sciweavers

999 search results - page 196 / 200
» On the Decidability of Functional Uncertainty
Sort
View
BMCBI
2008
130views more  BMCBI 2008»
13 years 7 months ago
An enhanced partial order curve comparison algorithm and its application to analyzing protein folding trajectories
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
Hong Sun, Hakan Ferhatosmanoglu, Motonori Ota, Yus...
BMCBI
2008
107views more  BMCBI 2008»
13 years 7 months ago
Probe-specific mixed-model approach to detect copy number differences using multiplex ligation-dependent probe amplification (ML
Background: MLPA method is a potentially useful semi-quantitative method to detect copy number alterations in targeted regions. In this paper, we propose a method for the normaliz...
Juan R. González, Josep L. Carrasco, Llu&ia...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 7 months ago
Harvesting Collective Intelligence: Temporal Behavior in Yahoo Answers
When harvesting collective intelligence, a user wishes to maximize the accuracy and value of the acquired information without spending too much time collecting it. We empirically ...
Christina Aperjis, Bernardo A. Huberman, Fang Wu
ENTCS
2008
73views more  ENTCS 2008»
13 years 7 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla
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