1254 search results - page 82 / 251 » Making Hard Problems Harder |
143
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
111
Voted
CRYPTO
2006
Springer
15 years 7 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
132
Voted
WWW
2011
ACM
14 years 10 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
170
Voted
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
176
Voted
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Blind deconvolution is the recovery of a sharp version of
a blurred image when the blur kernel is unknown. Recent
algorithms have afforded dramatic progress, yet many aspects
of...