Sciweavers

1503 search results - page 301 / 301
» Generalized Parity Games
Sort
View
ICALP
2011
Springer
12 years 9 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
12 years 9 months ago
No free lunch in data privacy
Differential privacy is a powerful tool for providing privacypreserving noisy query answers over statistical databases. It guarantees that the distribution of noisy query answers...
Daniel Kifer, Ashwin Machanavajjhala
CC
2003
Springer
250views System Software» more  CC 2003»
13 years 11 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...