1199 search results - page 53 / 240 » Parameterized Proof Complexity |
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
ESORICS
2009
Springer
14 years 9 months ago
2009
Springer
By shifting the burden of proofs to the user, a proof-carrying authorization (PCA) system can automatically enforce complex access control policies. Unfortunately, managing those p...
EOR
2008
13 years 8 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
IJCV
2000
13 years 8 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...