16430 search results - page 569 / 3286 » On Computable Tree Functions |
231
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted “cloud” server. In this notion that we call on-the-fly multiparty c...
187
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
211
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
220
click to vote
CN
2004
15 years 7 months ago
2004
This work deals with reconfigurable control functions and protocols for supporting mobile computing applications in heterogeneous wireless systems like cellular networks and WLANs...
172
click to vote
MFCS
2004
Springer
16 years 13 days ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...