Sciweavers

CVPR
2012
IEEE
12 years 3 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
12 years 3 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx
TAPAS
2011
255views Algorithms» more  TAPAS 2011»
13 years 7 months ago
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
Iyad A. Kanj, Fenghui Zhang