Sciweavers

107 search results - page 20 / 22
» When Random Play is Optimal Against an Adversary
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Understanding robustness of mobile networks through temporal network measures
—The application of complex network theory to communication systems has led to several important results. Nonetheless, previous research has often neglected to take into account ...
Salvatore Scellato, Ilias Leontiadis, Cecilia Masc...
ATAL
2008
Springer
13 years 9 months ago
Norm emergence under constrained interactions in diverse societies
Effective norms, emerging from sustained individual interactions over time, can complement societal rules and significantly enhance performance of individual agents and agent soci...
Partha Mukherjee, Sandip Sen, Stéphane Airi...
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
SIAMJO
2011
12 years 10 months ago
Rank-Sparsity Incoherence for Matrix Decomposition
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Pa...
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin