Abstract
A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log2 n. In the same spirit, we obtain a relatively simple method of constructing classifiers of depth O(log n). Consequently, for an arbitrary constant C > 3/log2 3 = 1.8927 . . ., we construct classifiers of depth O(log n) and of size at most Cn log2 n + O(n).
| Original language | English |
|---|---|
| Pages (from-to) | 709-739 |
| Number of pages | 31 |
| Journal | SIAM Journal on Computing |
| Volume | 25 |
| Issue number | 4 |
| Publication status | Published - Aug 1996 |
| Externally published | Yes |
Fingerprint
Keywords
- Classifier
- Comparator network
- Expander
- Selection network
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science
Cite this
A method of constructing selection networks with O(log n) depth. / Jinbo, Shuji; Maruoka, A.
In: SIAM Journal on Computing, Vol. 25, No. 4, 08.1996, p. 709-739.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A method of constructing selection networks with O(log n) depth
AU - Jinbo, Shuji
AU - Maruoka, A.
PY - 1996/8
Y1 - 1996/8
N2 - A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log2 n. In the same spirit, we obtain a relatively simple method of constructing classifiers of depth O(log n). Consequently, for an arbitrary constant C > 3/log2 3 = 1.8927 . . ., we construct classifiers of depth O(log n) and of size at most Cn log2 n + O(n).
AB - A classifier with n inputs is a comparator network that classifies a set of n values into two classes with the same number of values in such a way that each value in one class is at least as large as all of those in the other. Based on the utilization of expanders, Pippenger constructed classifiers with n inputs whose size is asymptotic to 2n log2 n. In the same spirit, we obtain a relatively simple method of constructing classifiers of depth O(log n). Consequently, for an arbitrary constant C > 3/log2 3 = 1.8927 . . ., we construct classifiers of depth O(log n) and of size at most Cn log2 n + O(n).
KW - Classifier
KW - Comparator network
KW - Expander
KW - Selection network
UR - http://www.scopus.com/inward/record.url?scp=0001661742&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0001661742&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0001661742
VL - 25
SP - 709
EP - 739
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
SN - 0097-5397
IS - 4
ER -