13784 search results - page 235 / 2757 » On Computing Functions with Uncertainty |
DAM
2007
13 years 9 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Sander, Young and Yung recently exhibited a protocol for computing on encrypted inputs, for functions computable in NC1 . In their variant of secure function evaluation, Bob (the &...
FTDCS
2003
IEEE
14 years 2 months ago
2003
IEEE
With the increasing prevalence of mobile devices, computing is being carried out on devices with varied resource constraints and is afflicted by constant changes in run-time conte...
ENTCS
2002
13 years 9 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
VIS
2009
IEEE
14 years 7 months ago
2009
IEEE
Simulation and computation in chemistry studies have been improved as computational power has increased over decades. Many types of chemistry simulation results are available, from...