—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
Guy Antoine Atenekeng Kahou, Laura Grigori, Masha ...
Capacitance extraction is an important problem that has been extensively studied. This paper presents a significant improvement for the fast multipole accelerated boundary element...
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...
Robert Bredereck, Jiehua Chen, Sepp Hartung, Rolf ...
We show how a special decomposition of a set of two or three general projection matrices, called canonic enables us to build geometric descriptions for a system of cameras which a...