Sciweavers

11562 search results - page 2272 / 2313
» Parallel Imaging Problem
Sort
View
FGCS
2008
105views more  FGCS 2008»
15 years 25 days ago
The Grid Workloads Archive
While large grids are currently supporting the work of thousands of scientists, very little is known about their actual use. Due to strict organizational permissions, there are fe...
Alexandru Iosup, Hui Li, Mathieu Jan, Shanny Anoep...
118
Voted
BMCBI
2006
118views more  BMCBI 2006»
15 years 25 days ago
Exploration of biological network centralities with CentiBiN
Background: The elucidation of whole-cell regulatory, metabolic, interaction and other biological networks generates the need for a meaningful ranking of network elements. Central...
Björn H. Junker, Dirk Koschützki, Falk S...
91
Voted
BMCBI
2006
130views more  BMCBI 2006»
15 years 25 days ago
MicroTar: predicting microRNA targets from RNA duplexes
Background: The accurate prediction of a comprehensive set of messenger RNAs (targets) regulated by animal microRNAs (miRNAs) remains an open problem. In particular, the predictio...
Rahul Thadani, Martti T. Tammi
129
Voted
BMCBI
2006
166views more  BMCBI 2006»
15 years 25 days ago
SEQOPTICS: a protein sequence clustering system
Background: Protein sequence clustering has been widely used as a part of the analysis of protein structure and function. In most cases single linkage or graph-based clustering al...
Yonghui Chen, Kevin D. Reilly, Alan P. Sprague, Zh...
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 24 days 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
« Prev « First page 2272 / 2313 Last » Next »