The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
This paper describes clime, a web-based legal advisory system with a multilingual natural language interface. clime is a `proof-of-concept' system which answers queries relat...
Roger Evans, Paul Piwek, Lynne J. Cahill, Neil Tip...
This paper is concerned with the performance evaluation of fingerprint verification systems. After an initial classification of biometric testing initiatives, we explore both the t...
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...