Sciweavers

3791 search results - page 34 / 759
» Packing sets of patterns
Sort
View
ORDER
2002
104views more  ORDER 2002»
14 years 10 months ago
Partially Well-Ordered Closed Sets of Permutations
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
PRL
2011
14 years 2 months ago
Versatile spectral methods for point set matching
Alberto Silletti, Alessandro Abate, Jeffrey D. Axe...
ICALP
2007
Springer
15 years 5 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
VTS
2007
IEEE
89views Hardware» more  VTS 2007»
15 years 5 months ago
Test Set Reordering Using the Gate Exhaustive Test Metric
When a test set size is larger than desired, some patterns must be dropped. This paper presents a systematic method to reduce test set size; the method reorders a test set using t...
Kyoung Youn Cho, Edward J. McCluskey
IBPRIA
2005
Springer
15 years 4 months ago
Parallel Perceptrons, Activation Margins and Imbalanced Training Set Pruning
A natural way to deal with training samples in imbalanced class problems is to prune them removing redundant patterns, easy to classify and probably over represented, and label noi...
Iván Cantador, José R. Dorronsoro