Sciweavers

10608 search results - page 537 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
CCE
2005
15 years 7 months ago
Numerical simulation of stochastic gene circuits
Armed with increasingly fast supercomputers and greater knowledge of the molecular mechanisms of gene expression, it is now practical to numerically simulate complex networks of r...
Howard Salis, Yiannis N. Kaznessis
EUROCRYPT
2012
Springer
13 years 9 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
BMCBI
2010
105views more  BMCBI 2010»
15 years 7 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
CP
2000
Springer
15 years 11 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
DAGSTUHL
2010
15 years 8 months ago
Towards Automatic Feature-based Visualization
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
Heike Jänicke, Gerik Scheuermann