3415 search results - page 118 / 683 » Lower Bounds for Kernelizations |
110
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
160
click to vote
IJCAI
2007
15 years 5 months ago
2007
We propose a novel variant of the conjugate gradient algorithm, Kernel Conjugate Gradient (KCG), designed to speed up learning for kernel machines with differentiable loss functio...
109
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
MLQ
2008
15 years 4 months ago
2008
An account of lower and upper integration is given. It is constructive in the sense of geometric logic. If the integrand takes its values in the nonnegative lower reals, then its ...
137
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...