16430 search results - page 313 / 3286 » On Computable Tree Functions |
145
click to vote
ZUM
2000
Springer
15 years 8 months ago
2000
Springer
We present a computation model for Z, which is based on a reduction to a small calculus, called Z, and on concurrent constraint resolution techniques applied for computing in thi...
142
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
126
Voted
TCC
2009
Springer
16 years 5 months ago
2009
Springer
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
146
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
146
click to vote
ISM
2006
IEEE
15 years 4 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...