642 search results - page 69 / 129 » Approximation Algorithms for Minimum K-Cut |
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
100
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
133
click to vote
ESA
2003
Springer
15 years 5 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...