Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Suppose we are given a (possibly redundant) system of linear equalities and linear inequalities, C, and a solved form for C, and we now delete a constraint from C. We give an algorithm to incrementally compute a solved form for this new system. The algorithm has cost O(n2) where n is the number of constraints in C, while computing the solved form directly has expected cost O(n3). To our knowledge this is the first incremental algorithm for (re)computing a solved form after deleting a constraint. © 1995.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008