Abstract
The central limit theorem is proved for the domination number of random class cover catch digraphs generated by uniform data in one dimension. The class cover problem is motivated by applications in statistical pattern classification.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
