Sciweavers

6599 search results - page 1319 / 1320
» Towards a Theory of Information
Sort
View
TON
2012
13 years 12 hour 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»
13 years 12 hour 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
PODC
2012
ACM
13 years 4 hour ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
ICDT
2012
ACM
242views Database» more  ICDT 2012»
12 years 12 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»
12 years 12 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
« Prev « First page 1319 / 1320 Last » Next »