237 search results - page 21 / 48 » On the decidability and complexity of reasoning about only k... |
226
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
161
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...
160
click to vote
CONCUR
2007
Springer
16 years 7 days ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
166
click to vote
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 9 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...