86 search results - page 13 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
74
Voted
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
114
Voted
JMLR
2012
13 years 2 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
118
Voted
STACS
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
107
Voted
IANDC
2007
14 years 11 months ago
2007
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
94
Voted
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...