Sciweavers

432 search results - page 50 / 87
» Minimum Weight Pseudo-Triangulations
Sort
View
MP
2006
84views more  MP 2006»
13 years 7 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
14 years 8 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 2 months ago
Semi-Blind Spatial Equalisation for MIMO Channels with Quadrature Amplitude Modulation
— Semi-blind spatial equalisation is considered for multiple-input multiple-output (MIMO) systems that employ high-throughput quadrature amplitude modulation scheme. A minimum nu...
Sheng Chen, Lajos Hanzo, Wang Yao
VTC
2008
IEEE
167views Communications» more  VTC 2008»
14 years 2 months ago
CMA and Soft Decision-Directed Scheme for Semi-Blind Beamforming of QAM Systems
— We propose a semi-blind adaptive beamforming approach for wireless systems that employ high-throughput quadrature amplitude modulation signalling schemes. A minimum number of t...
Sheng Chen, Wang Yao, Lajos Hanzo
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella