Sciweavers

1331 search results - page 118 / 267
» Complexity bounds for zero-test algorithms
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
13 years 11 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
GLOBECOM
2007
IEEE
14 years 4 months ago
Performance Analysis of V-BLAST with Optimum Power Allocation
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
Victoria Kostina, Sergey Loyka
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 10 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
CORR
2010
Springer
148views Education» more  CORR 2010»
13 years 5 months ago
A Unifying View of Multiple Kernel Learning
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
Marius Kloft, Ulrich Rückert, Peter L. Bartle...
ICASSP
2011
IEEE
13 years 1 months ago
Robust adaptive beamforming based on jointly estimating covariance matrix and steering vector
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
Yujie Gu, Amir Leshem