Sciweavers

236 search results - page 9 / 48
» Binary Partitions Revisited
Sort
View
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
13 years 6 months ago
Counting canonical partitions in the random graph
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...
Jean A. Larson
ICDAR
2003
IEEE
14 years 21 days ago
Binary Classification Trees for Multi-class Classification Problems
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 ...
Jin-Seon Lee, Il-Seok Oh
EVOW
2010
Springer
14 years 2 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
FTSIG
2008
102views more  FTSIG 2008»
13 years 7 months ago
Set Partition Coding: Part I of Set Partition Coding and Image Wavelet Coding Systems
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...
William A. Pearlman, Amir Said
HPCC
2007
Springer
14 years 1 months ago
Parallel Database Sort and Join Operations Revisited on Grids
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...
Werner Mach, Erich Schikuta