2430 search results - page 179 / 486 » Computing Tutte Polynomials |
172
click to vote
SIGECOM
2011
ACM
14 years 7 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
164
Voted
IPMI
2003
Springer
16 years 5 months ago
2003
Springer
Abstract. For medical image analysis issues where the domain mappings between images involve large geometrical shape changes, such as the cases of nonrigid motion recovery and inte...
143
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—Trusted Collaborative Computing (TCC) is a new research and application paradigm. Two important challenges in such a context are represented by secure information transmission a...
179
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
175
Voted
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...