337 search results - page 1 / 68 » Computational complexity of weighted splitting schemes on pa... |
PAAPP
2007
13 years 4 months ago
2007
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
TIT
2010
13 years 2 days ago
2010
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
TCS
2008
13 years 5 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...