3378 search results - page 163 / 676 » A universe of binding and computation |
NDJFL
2010
14 years 4 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
SIGUCCS
2000
ACM
15 years 1 months ago
2000
ACM
The School of Architecture and Allied Arts at the University of Oregon consists of nine departments and programs with 5000 students, 160 faculty, and a few dozen staff. When I cam...
CCGRID
2001
IEEE
15 years 1 months ago
2001
IEEE
- With the progress of research on cluster computing, more and more universities have begun to offer various courses covering cluster computing. A wide variety of content can be ta...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
COMPUTER
2002
14 years 10 months ago
2002
wever, by using a simple model of abstract building blocks: quantum bits, gates, and algorithms, and the available implementation technologies--in all their imperfections.7 The bas...