Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
A new approach for encoding any string of information bits into a sequence having bounded running digital sum is presented. The results improve previously known values of the running digital sum for the same rate. Also discussed are ways of incorporating error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases. © 1993 IEEE
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Michael D. Moffitt
ICCAD 2009
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012