Abstract. We present algorithms that perform the extraction of partial assignments from binary Constraint Satisfaction Problems without introducing new constraints. They are based ...
Abstract. To the best of our knowledge, this paper is the first attempt to formalise a pragmatic logic of scientific discovery in a manner such that it can be realised by scientist...
Jean Sallantin, Christopher Dartnell, Mohammad Afs...
Abstract. The ultimate aim of our research is a free, evolutionary, Internetbased, agent-based, long-distance teaching environment for academic English. For this purpose, we are bu...
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kus...
Abstract. The paper argues that a promising way to improve the success rate of preference-based anaphora resolution algorithms is the use of machine learning. The paper outlines MA...