18090 search results - page 217 / 3618 » Computing by Only Observing |
146
click to vote
BSL
2005
15 years 6 months ago
2005
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...
172
click to vote
EUC
2006
Springer
15 years 10 months ago
2006
Springer
Wireless sensor networks and Radio Frequency Identifiers are becoming mainstream applications of ubiquitous computing. They are slowly being integrated into our infrastructure and ...
184
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
130
click to vote
LPAR
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...
190
click to vote
FPL
2004
Springer
15 years 10 months ago
2004
Springer
Wavelet-based image compression has been suggested previously as a means to evaluate and compare both traditional and reconfigurable computers in terms of performance and resource ...