2430 search results - page 230 / 486 » Computing Tutte Polynomials |
150
click to vote
AMW
2010
15 years 5 months ago
2010
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
116
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
136
click to vote
AAAI
2006
15 years 5 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
128
click to vote
CMS
2006
15 years 5 months ago
2006
At the Asiacrypt 2003 conference Billet and Gilbert introduce a block cipher, which, to quote them, has the following paradoxical traceability properties: it is computationally ea...
153
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...