We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
Mutsumi Fukuzaki, Mio Seki, Hisashi Kashima, Jun S...
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice...
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...
Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor...
Abstract. Use cases are a popular way of specifying functional requirements of computer-based systems. Each use case contains a sequence of steps which are described with a natural...
Alicja Ciemniewska, Jakub Jurkiewicz, Lukasz Olek,...