16430 search results - page 781 / 3286 » On Computable Tree Functions |
141
click to vote
PERVASIVE
2004
Springer
16 years 26 days ago
2004
Springer
In this paper, we propose a new framework for ubiquitous computing by rule-based, event-driven I/O (input/output) control devices. Our approach is flexible and autonomous because ...
184
click to vote
CRYPTO
2007
Springer
15 years 11 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
193
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
205
click to vote
INTERACTION
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
177
Voted
CIE
2007
Springer
16 years 1 months ago
2007
Springer
The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930’s working on various precise defini...