Sciweavers

3192 search results - page 113 / 639
» The minimum latency problem
Sort
View
128
Voted
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 5 months ago
Covering minimum spanning trees of random subgraphs
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 ...
Michel X. Goemans, Jan Vondrák
142
Voted
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 6 months ago
Global minimum cuts in surface embedded graphs
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,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
138
Voted
ICC
2008
IEEE
107views Communications» more  ICC 2008»
15 years 10 months ago
Minimum BER Transmit Beamforming for MIMO-OFDM Systems with Finite Rate Feedback
— 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...
ISCAS
2008
IEEE
86views Hardware» more  ISCAS 2008»
15 years 10 months ago
Minimum redundancy MIMO radars
—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...
Chun-Yang Chen, Palghat P. Vaidyanathan
139
Voted
ACISICIS
2007
IEEE
15 years 10 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
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...
Gerhard Visser, David L. Dowe