986 search results - page 34 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
Learning-based superresolution (SR) are popular SR techniques that use application dependent priors to infer the missing details in low resolution images (LRIs). However, their pe...
TIT
2010
13 years 2 months 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...