Sciweavers

12015 search results - page 2205 / 2403
» Interactive Algorithms 2005
Sort
View
RECOMB
2005
Springer
14 years 11 months ago
Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
Chen Yanover, Tomer Hertz
CADE
2005
Springer
14 years 11 months ago
Privacy-Sensitive Information Flow with JML
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
Guillaume Dufay, Amy P. Felty, Stan Matwin
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
14 years 11 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 11 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 11 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
« Prev « First page 2205 / 2403 Last » Next »