236 search results - page 9 / 48 » Binary Partitions Revisited |
90
Voted
COMBINATORICA
2008
14 years 11 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
101
Voted
ICDAR
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
94
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
FTSIG
2008
15 years 22 days ago
2008
The purpose of this two-part monograph is to present a tutorial on set partition coding, with emphasis and examples on image wavelet transform coding systems, and describe their u...
104
click to vote
HPCC
2007
Springer
15 years 6 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...