We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
An orthogonal Ore ring is an abstraction of common properties of linear partial differential, shift and q-shift operators. Using orthogonal Ore rings, we present an algorithm for...
Treemaps support visualization of large hierarchical information spaces. The treemap generation algorithm is straightforward and application prototypes have only minimal hardware ...
We developa clustereddithering methodthatusesstochasticscreening and is able to perform an adaptive variation of the cluster size. This makes it possible to achieve optimal rendit...
In this paper we study the problem of explicitly constructing a dimension expander raised by [BISW04]: Let Fn be the n dimensional linear space over the field F. Find a small (ide...