1578 search results - page 101 / 316 » Algorithmic randomness of continuous functions |
STOC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
CIT
2006
Springer
15 years 1 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
BMCBI
2010
14 years 10 months ago
2010
Background: The ability to design thermostable proteins is theoretically important and practically useful. Robust and accurate algorithms, however, remain elusive. One critical pr...
PODS
2001
ACM
15 years 10 months ago
2001
ACM
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...