KAIS
2007
13 years 9 months ago
2007
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
TWC
2008
13 years 9 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
TWC
2008
13 years 9 months ago
2008
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
TWC
2008
13 years 9 months ago
2008
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. ...
TWC
2008
13 years 9 months ago
2008
This contribution deals with code-aided hypothesis testing for wireless digital receivers. We provide a theoretical justification for a hypothesis testing algorithm that was previo...
TWC
2008
13 years 9 months ago
2008
Abstract-- Turbo equalization improves communication system performance by iteratively exchanging information between soft-input soft-output (SISO) equalizer and SISO channel decod...
AMC
2004
13 years 9 months ago
2004
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
ALGORITHMICA
2004
13 years 9 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
ALGORITHMICA
2004
13 years 9 months ago
2004
Abstract. We present an O(n log n)-time algorithm to solve the threedimensional layers-of-maxima problem, an improvement over the prior O(n log n log log n)-time solution. A previo...
ALGORITHMICA
2004
13 years 9 months ago
2004
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...