2 papers
eess.SP2026
Sparse Graph Learning from Sparse Data via Fiedler Number Maximization
Bahar Oveisgharan, Gene Cheung, Andrew Eckford
We aim to learn a sparse and connected graph from sparse data, where the number of observations K can be substantially smaller than the signal dimension N for signals x in R^N, and…
cs.NI2019
Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms
Maryam Mohseni, S. Alireza Banani, Andrew W. Eckford +1
We consider scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is t…