Sciweavers

2168 search results - page 108 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
WISEC
2009
ACM
15 years 10 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CCS
2011
ACM
14 years 3 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 10 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
ATAL
2008
Springer
15 years 5 months ago
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
Yoram Bachrach, Evangelos Markakis, Ariel D. Proca...
CVPR
2009
IEEE
16 years 10 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori