Sciweavers

5056 search results - page 848 / 1012
» Network Coding Theory
Sort
View
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 10 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
ATAL
2011
Springer
14 years 6 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
MOBIHOC
2012
ACM
13 years 9 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
IWCMC
2009
ACM
16 years 1 months ago
Effect of feedback prediction on OFDMA system throughput
In wireless communication systems, adaptive modulation and coding (AMC) is used to improve the downlink (DL) spectral efficiency by exploiting the underlying channel condition. Ho...
Mohammad Abdul Awal, Lila Boukhatem
ACSAC
2008
IEEE
16 years 29 days ago
Execution Trace-Driven Automated Attack Signature Generation
In its most general form, an attack signature is a program that can correctly determine if an input network packet sequence can successfully attack a protected network application...
Susanta Nanda, Tzi-cker Chiueh