608 search results - page 43 / 122 » Tests, Proofs and Refinements |
174
click to vote
FC
2005
Springer
16 years 8 days ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
193
Voted
JMLR
2012
13 years 9 months ago
2012
This document contains supplementary material to the article ‘Statistical test for consistent estimation of causal effects in linear non-Gaussian models’, AISTATS 2012. A tabl...
169
click to vote
RSA
2006
15 years 6 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
191
click to vote
TPHOL
2005
IEEE
16 years 9 days ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
224
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...