16430 search results - page 665 / 3286 » On Computable Tree Functions |
156
click to vote
ADCM
2010
15 years 7 months ago
2010
We present an algorithm for computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit ...
129
click to vote
ENTCS
2008
15 years 7 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
177
click to vote
EUROCRYPT
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
169
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
209
click to vote
HYBRID
2009
Springer
16 years 2 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...