44 search results - page 4 / 9 » On basing one-way functions on NP-hardness |
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
ECCC
2006
13 years 8 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
EIT
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a schema to build one way functions from a family of Boolean gates. Moreover, we relate characteristics of these Boolean gate truth tables to properties of the derived ...
JMLR
2010
13 years 3 months ago
2010
Interest in multioutput kernel methods is increasing, whether under the guise of multitask learning, multisensor networks or structured output data. From the Gaussian process pers...
GIS
2005
ACM
14 years 9 months ago
2005
ACM
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...