Sciweavers

3415 search results - page 10 / 683
» Lower Bounds for Kernelizations
Sort
View
JC
2006
68views more  JC 2006»
13 years 9 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
APPROX
2010
Springer
120views Algorithms» more  APPROX 2010»
13 years 11 months ago
Uniform Derandomization from Pathetic Lower Bounds
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
Eric Allender, Vikraman Arvind, Fengming Wang
EOR
2007
99views more  EOR 2007»
13 years 9 months ago
Computing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...
ICASSP
2011
IEEE
13 years 1 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes
AAAI
2004
13 years 11 months ago
Study of Lower Bound Functions for MAX-2-SAT
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
Haiou Shen, Hantao Zhang