16404 search results - page 142 / 3281 » A set coverage problem |
104
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
144
click to vote
DCOSS
2011
Springer
14 years 3 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
DATE
2003
IEEE
15 years 8 months ago
2003
IEEE
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
107
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper we try to characterize a set of classification problems. For this, we use the disagreement between a set of standard classifiers. The disagreement patterns do not on...
140
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...