Sciweavers

8499 search results - page 1525 / 1700
» cans 2009
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
16 years 7 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 7 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
RECOMB
2009
Springer
16 years 7 months ago
An Online Approach for Mining Collective Behaviors from Molecular Dynamics Simulations
Collective behavior involving distally separate regions in a protein is known to widely affect its function. In this paper, we present an online approach to study and characterize ...
Arvind Ramanathan, Pratul K. Agarwal, Maria Kurnik...
RECOMB
2009
Springer
16 years 7 months ago
How Many Bootstrap Replicates Are Necessary?
Phylogenetic Bootstrapping (BS) is a standard technique for inferring confidence values on phylogenetic trees that is based on reconstructing many trees from minor variations of th...
Nicholas D. Pattengale, Masoud Alipour, Olaf R. P....
« Prev « First page 1525 / 1700 Last » Next »