In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
Jacob Scott, Trey Ideker, Richard M. Karp, Roded S...
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...