Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Paper
A note on approximate linear programming
Abstract
M. Serna recently proved that approximating linear programming is log-space complete for P. This note shows a direct reduction of the exact problem to Serna' approximate one. © 1992.
Related
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
S. Sattanathan, N.C. Narendra, et al.
CONTEXT 2005
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014