The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea ...
Parasaran Raman, Jeff M. Phillips, Suresh Venkatas...
Previous research on the skills needed by data quality professionals have focused on Information Systems (IS) curriculum standards, survey input from Information Quality (IQ) profe...
The error correction capability of binary linear codes with minimum distance decoding, in particular the number of correctable/uncorrectable errors, is investigated for general lin...