Transmit beamforming for physical-layer multicasting
- N. Sidiropoulos, T. Davidson, Z. Luo
- BusinessIEEE Transactions on Signal Processing
- 1 June 2006
This paper considers the problem of downlink transmit beamforming for wireless transmission and downstream precoding for digital subscriber wireline transmission, in the context of common information…
Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering
- Bo Yang, Xiao Fu, N. Sidiropoulos, Mingyi Hong
- Computer ScienceInternational Conference on Machine Learning
- 15 October 2016
A joint DR and K-means clustering approach in which DR is accomplished via learning a deep neural network (DNN) while exploiting theDeep neural network's ability to approximate any nonlinear function is proposed.
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
- E. Karipidis, N. Sidiropoulos, Z. Luo
- BusinessIEEE Transactions on Signal Processing
- 1 March 2008
It is shown that Lagrangian relaxation coupled with suitable randomization/cochannel multicast power control yield computationally efficient high-quality approximate solutions.
Blind PARAFAC receivers for DS-CDMA systems
- N. Sidiropoulos, G. Giannakis, R. Bro
- BusinessIEEE Transactions on Signal Processing
- 1 March 2000
This paper links the direct-sequence code-division multiple access (DS-CDMA) multiuser separation-equalization-detection problem to the parallel factor (PARAFAC) model, which is an analysis tool…
Tensor Decomposition for Signal Processing and Machine Learning
- N. Sidiropoulos, L. Lathauwer, Xiao Fu, Kejun Huang, E. Papalexakis, C. Faloutsos
- Computer ScienceIEEE Transactions on Signal Processing
- 6 July 2016
The material covered includes tensor rank and rank decomposition; basic tensor factorization models and their relationships and properties; broad coverage of algorithms ranging from alternating optimization to stochastic gradient; statistical performance analysis; and applications ranging from source separation to collaborative filtering, mixture and topic modeling, classification, and multilinear subspace learning.
Parallel factor analysis in sensor array processing
- N. Sidiropoulos, R. Bro, G. Giannakis
- MathematicsIEEE Transactions on Signal Processing
- 1 August 2000
This link facilitates the derivation of powerful identifiability results for MI-SAP, shows that the uniqueness of single- and multiple-invariance ESPRIT stems from uniqueness of low-rank decomposition of three-way arrays, and allows tapping on the available expertise for fitting the PARAFAC model.
SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication
- Shaden Smith, N. Ravindran, N. Sidiropoulos, G. Karypis
- Computer ScienceIEEE International Parallel and Distributed…
- 1 May 2015
Multi-dimensional arrays, or tensors, are increasingly found in fields such as signal processing and recommender systems. Real-world tensors can be enormous in size and often very sparse. There is a…
Convex approximation techniques for joint multiuser downlink beamforming and admission control
- E. Matskani, N. Sidiropoulos, Z. Luo, L. Tassiulas
- Computer ScienceIEEE Transactions on Wireless Communications
- 1 July 2008
This work advocates a cross-layer approach to joint multiuser transmit beamforming and admission control, aiming to maximize the number of users that can be served at their desired QoS.
Consensus-ADMM for General Quadratically Constrained Quadratic Programming
- Kejun Huang, N. Sidiropoulos
- Computer ScienceIEEE Transactions on Signal Processing
- 11 January 2016
The core components are carefully designed to make the overall algorithm more scalable, including efficient methods for solving QCQP-1, memory efficient implementation, parallel/distributed implementation, and smart initialization.
A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Kejun Huang, N. Sidiropoulos, A. Liavas
- Computer ScienceIEEE Transactions on Signal Processing
- 13 June 2015
A hybrid between alternating optimization and the alternating direction method of multipliers, each matrix factor is updated in turn, using ADMM, hence the name AO-ADMM, which can naturally accommodate a great variety of constraints on the factor matrices, and almost all possible loss measures for the fitting.
...
...