We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
— In this paper, we consider minimum bit error rate (BER) beamforming (BF) for multiple–input multiple–output orthogonal frequency division multiplexing (MIMO–OFDM) systems...
Yang-wen Liang, Robert Schober, Wolfgang H. Gersta...
—The multiple-input multiple-output (MIMO) radar concept has drawn considerable attention recently. In the traditional single-input multiple-output (SIMO) radar system, the trans...
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...