Sciweavers

4622 search results - page 924 / 925
» Foundations of Information Theory
Sort
View
TON
2012
11 years 8 months ago
A Game-Theoretic Approach to Anonymous Networking
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
Parvathinathan Venkitasubramaniam, Lang Tong
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 8 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 8 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
AAAI
2012
11 years 8 months ago
Strategic Advice Provision in Repeated Human-Agent Interactions
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
Amos Azaria, Zinovi Rabinovich, Sarit Kraus, Claud...