16430 search results - page 494 / 3286 » On Computable Tree Functions |
176
click to vote
FPL
2003
Springer
16 years 5 days ago
2003
Springer
Although microarrays are already having a tremendous impact on biomedical science, they still present great computational challenges. We examine a particular problem involving the...
173
click to vote
EUROGP
1998
Springer
15 years 11 months ago
1998
Springer
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
176
click to vote
IS
2010
15 years 5 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
174
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
185
click to vote
CRYPTO
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...