Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
In this paper, we propose a transmit beamspace energy focusing technique for multiple-input multiple-output (MIMO) radar with application to direction finding for multiple targets...
Ensuring sufficient liquidity is one of the key challenges for designers of prediction markets. Various market making algorithms have been proposed in the literature and deployed ...
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
We present a model-driven approach to the segmentation of nasal cavity and paranasal sinus boundaries. Based on computed tomography data of a patients head, our approach aims to ex...
Carsten Last, Simon Winkelbach, Friedrich M. Wahl,...