Sciweavers

237 search results - page 21 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
SIGMOD
2009
ACM
185views Database» more  SIGMOD 2009»
14 years 7 months ago
Attacks on privacy and deFinetti's theorem
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...
Daniel Kifer
CVPR
2006
IEEE
14 years 9 months ago
Gesture Recognition using Hidden Markov Models from Fragmented Observations
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 ...
Ruiduo Yang, Sudeep Sarkar
CONCUR
2007
Springer
14 years 1 months ago
Strategy Logic
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...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
PARLE
1987
13 years 11 months ago
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
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...
Peter H. Welch
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
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...
Florent Becker, Martín Matamala, Nicolas Ni...