13784 search results - page 244 / 2757 » On Computing Functions with Uncertainty |
136
click to vote
SPAA
2006
ACM
16 years 2 days ago
2006
ACM
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
165
click to vote
TIT
2010
15 years 25 days ago
2010
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
156
Voted
CSR
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
157
click to vote
FUIN
2006
15 years 6 months ago
2006
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
161
click to vote
DIGITEL
2007
IEEE
16 years 14 days ago
2007
IEEE
Distributed Computational Toys are physical artifacts that function based on the coordination of more than one computing device. Often, these toys take the form of a microcontroll...