3250 search results - page 29 / 650 » Parameterized Learning Complexity |
TCAD
2002
13 years 9 months ago
2002
Specialized clustered very large instruction word (VLIW) processors combined with effective compilation techniques enable aggressive exploitation of the high instruction-level para...
TIT
2010
13 years 4 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...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
ACID
2006
13 years 11 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...