SIGN IN
SIGN UP
Data driven approach to designing minimum hamming distance polychotomizer
Full Text:
PDF
Buy this Article
Authors:
Jie Zhou
Northern Illinois University, DeKalb IL
Giovanni Pasteris
Northern Illinois University, DeKalb IL
Published in:
· Proceeding
SAC '05
Proceedings of the 2005 ACM symposium on Applied computing
Pages 27-31
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-964-0
doi>
10.1145/1066677.1066687
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 9
· Downloads (cumulative): 317
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
coding matrix
experimentation
learning
minimum hamming distance
polychotomizer
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder