In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
Presenting material in a more object-oriented way is a growing trend in Computer Science education. er takes the idea of objects-first or abstraction-first teaching a step further...
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...