71 search results - page 7 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
RANDOM
1997
Springer
15 years 1 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
103
click to vote
DAIS
2011
14 years 1 months ago
2011
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
112
click to vote
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...