We introduce a new technique for the efficient management of large sequences of multi-dimensional data, which takes advantage of regularities that arise in real-world datasets and supports different types of aggregation ...

Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within main memory. These representations at least provide ...

In the present paper we classify all irreducible continuous representations of the simple linearly compact n-Lie superalgebra of type W. The classification is based on a bijective correspondence between the continuous ...

In the present paper, we classify all irreducible continuous representations of the simple linearly compact n-Lie superalgebra of type S. The classification is based on a bijective correspondence between the continuous ...

Let Γ1 and Γ2 be Bieberbach groups contained in the full isometry group G of Rn. We provethat if the compact flat manifolds Γ1\Rn and Γ2\Rn are strongly isospectral, then the Bieberbachgroups Γ1 and Γ2 are representation ...

CNN-based models currently provide state-of-the-art performance in image categorization tasks. While these methods are powerful in terms of representational capacity, they are generally not conceived with explicit means ...

There are many representations of planar graphs, but few are as elegant as Turán’s (1984): it is simple and practical, uses only 4 bits per edge, can handle self-loops and multiedges, and can store any specified embedding. ...