Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
K. M. Zahidul Islam, Tareq Y. Al-Naffouri, Naofal ...
People spend most of their time at a few key locations, such as home and work. Being able to identify how the movements of people cluster around these “important places” is cru...
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...