741 search results - page 2 / 149 » A Note on the Use of Independent Sets for the k-SAT Problem |
ICDE
2010
IEEE
13 years 11 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
IWOCA
2010
Springer
12 years 11 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
CVPR
2011
IEEE
13 years 8 days ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
ALGORITHMICA
2010
13 years 5 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...