2413 search results - page 252 / 483 » Models for universal usability |
104
Voted
STOC
1997
ACM
15 years 5 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
104
Voted
DBPL
1993
Springer
15 years 5 months ago
1993
Springer
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
122
Voted
SIGUCCS
2000
ACM
15 years 4 months ago
2000
ACM
Anyone who works with student employees knows that while it is often difficult to train sufficiently, it is of the utmost importance to have a qualified, knowledgeable staff. We w...
101
Voted
CCS
2008
ACM
15 years 3 months ago
2008
ACM
A well-known concern in the setting of identity based encryption is that the PKG is all powerful and has to be completely trusted. To mitigate this problem, the notion of Accounta...
114
Voted
WG
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...