133 search results - page 6 / 27 » Locally Excluding a Minor |
NIPS
2007
13 years 8 months ago
2007
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
DICTA
2009
13 years 5 months ago
2009
Local features are gaining popularity due to their robustness to occlusion and other variations such as minor deformation. However, using local features for recognition of biometri...
DAWAK
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we discuss problems of constructing classifiers from imbalanced data. We describe a new approach to selective preprocessing of imbalanced data which combines local ov...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
SIAMDM
2008
13 years 7 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...