16404 search results - page 173 / 3281 » A set coverage problem |
117
Voted
IEE
2002
15 years 3 months ago
2002
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
121
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
142
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
131
Voted
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
128
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...