3937 search results - page 253 / 788 » Questioning Ubiquitous Computing |
166
click to vote
IACR
2011
14 years 4 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
168
click to vote
ICAC
2009
IEEE
15 years 11 months ago
2009
IEEE
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
153
click to vote
STACS
2012
Springer
14 years 23 hour ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
140
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
163
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...