Sciweavers

1242 search results - page 233 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 17 days ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
SIGMETRICS
2010
ACM
233views Hardware» more  SIGMETRICS 2010»
14 years 4 days ago
Incentivizing peer-assisted services: a fluid shapley value approach
A new generation of content delivery networks for live streaming, video on demand, and software updates takes advantage of a peer-to-peer architecture to reduce their operating co...
Vishal Misra, Stratis Ioannidis, Augustin Chaintre...
CSR
2010
Springer
14 years 4 days ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
13 years 11 months ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SOUPS
2010
ACM
13 years 11 months ago
Parenting from the pocket: value tensions and technical directions for secure and private parent-teen mobile safety
An increasing number of high-tech devices, such as driver monitoring systems and Internet usage monitoring tools, are advertised as useful or even necessary for good parenting of ...
Alexei Czeskis, Ivayla Dermendjieva, Hussein Yapit...