Sciweavers

1554 search results - page 23 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
15 years 10 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...
UAI
2004
14 years 11 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
TIT
2010
160views Education» more  TIT 2010»
14 years 4 months ago
Parameterized splitting systems for the discrete logarithm
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...
Sungwook Kim, Jung Hee Cheon
CSL
2010
Springer
14 years 11 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
IWOCA
2009
Springer
112views Algorithms» more  IWOCA 2009»
15 years 2 months ago
The Guarding Problem - Complexity and Approximation
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...