In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
The concept of diversity was successfully introduced for recommender-systems. By displaying results that are not only similar to a target problem but also diverse among themselves,...
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...