7106 search results - page 774 / 1422 » Restricted Complexity, General Complexity |
246
click to vote
COCO
2005
Springer
16 years 28 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
245
click to vote
CRYPTO
2005
Springer
16 years 28 days ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
196
Voted
GECCO
2005
Springer
16 years 27 days ago
2005
Springer
GP uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees, and GP searches t...
173
click to vote
WPES
2003
ACM
16 years 19 days ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
245
click to vote
ESSMAC
2003
Springer
16 years 18 days ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...