Sciweavers

6142 search results - page 113 / 1229
» The Complexity of Partition Functions
Sort
View
BMCBI
2010
105views more  BMCBI 2010»
14 years 10 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
COLT
2001
Springer
15 years 2 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
ICPR
2004
IEEE
15 years 11 months ago
Spectral Sound Gap Filling
We present a new method for automatically filling in gaps of textural sounds. Our approach is to transform the signal to the time-frequency space, fill in the gap, and apply the i...
Alon Fishbach, Iddo Drori, Yehezkel Yeshurun
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 4 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
15 years 2 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan