3415 search results - page 4 / 683 » Lower Bounds for Kernelizations |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
ALT
2004
Springer
14 years 6 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...
JMLR
2012
12 years 7 days 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,...
COMPGEOM
1995
ACM
14 years 1 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...