Sciweavers

5056 search results - page 817 / 1012
» Network Coding Theory
Sort
View
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 9 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
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
16 years 6 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
SSS
2007
Springer
130views Control Systems» more  SSS 2007»
16 years 19 days ago
Decentralized Detector Generation in Cooperative Intrusion Detection Systems
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...
Rainer Bye, Katja Luther, Seyit Ahmet Çamte...
PODC
2010
ACM
15 years 10 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
ATAL
2008
Springer
15 years 8 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...