2372 search results - page 318 / 475 » Probabilistic calling context |
121
Voted
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
We analyze limited wavelength translation in all-optical, wavelength division multiplexed (WDM) wraparound mesh networks, where upto W wavelengths, each of which can carry one circ...
120
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
158
Voted
SIGMOD
1993
ACM
15 years 6 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
139
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
143
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...