1538 search results - page 153 / 308 » Spectral Techniques in Graph Algorithms |
109
click to vote
TASLP
2008
15 years 3 months ago
2008
In this paper, we evaluate the performance of several objective measures in terms of predicting the quality of noisy speech enhanced by noise suppression algorithms. The objective ...
135
click to vote
TSP
2008
15 years 3 months ago
2008
In this paper, we consider the problem of blind multiuser separation-equalization in the uplink of a wideband DS-CDMA system, in a multipath propagation environment with intersymbo...
130
click to vote
IPCO
2001
15 years 5 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
134
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
144
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...