16666 search results - page 311 / 3334 » Descriptive and Computational Complexity |
177
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...
190
click to vote
ISW
2010
Springer
15 years 4 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
180
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
236
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The ability to search for and precisely compare similar phenotypic appearances within and across species has vast potential in plant science and genetic research. The ...
217
click to vote
COLING
2010
15 years 1 months ago
2010
The system presented is a web application designed to aid linguistic research with data collection and online publishing. It is a service mainly for linguists and language experts...