203 search results - page 25 / 41 » Real Arguments Are Approximate Arguments |
129
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
131
click to vote
ICIAP
2007
ACM
16 years 4 months ago
2007
ACM
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...
130
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
114
click to vote
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
We consider two of the most commonly cited measures of retrieval performance: average precision and R-precision. It is well known that average precision and R-precision are highly...
134
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract—The end-to-end nature of Internet congestion control is an important factor in its scalability and robustness. However, end-to-end congestion control algorithms alone ar...