3791 search results - page 67 / 759 » Packing sets of patterns |
DM
2008
14 years 11 months ago
2008
A set partition is said to be (k, d)-noncrossing if it avoids the pattern 12
114
click to vote
DIS
2000
Springer
15 years 3 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
IJCAI
1989
15 years 13 days ago
1989
Classification methods from statistical pattern recognition, neural nets, and machine learning were applied to four real-world data sets. Each of these data sets has been previous...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
This paper presents a new learning approach for pattern classification applications involving imbalanced data sets. In this approach, a clustering technique is employed to resamp...