16430 search results - page 444 / 3286 » On Computable Tree Functions |
215
click to vote
FCS
2006
15 years 8 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
147
click to vote
ASAP
2006
IEEE
16 years 29 days ago
2006
IEEE
This work proposes a new architecture and execution model called 2D-VLIW. This architecture adopts an execution model based on large pieces of computation running over a matrix of...
172
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
154
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We consider a new model for computing with uncertainty. It is desired to compute a function f X1; : : : ; Xn where X1; : : : ; Xn are unknown, but guaranteed to lie in speci ed i...
174
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...