3 citations · 3 across the 4 of their papers we have counts for
3 papers
math.PR2016★ 3 cited
Robust Scheduling for Flexible Processing Networks
Ramtin Pedarsani, Jean Walrand, Yuan Zhong
Modern processing networks often consist of heterogeneous servers with widely varying capabilities, and process job flows with complex structure and requirements. A major challenge…
cs.IT2014
Capacity-Approaching PhaseCode for Low-Complexity Compressive Phase Retrieval
Ramtin Pedarsani, Kangwook Lee, Kannan Ramchandran
In this paper, we tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, , from the magnitudes…
math.DS2014
Analysis of Fixed-Time Control
Ajith Muralidharan, Ramtin Pedarsani, Pravin Varaiya
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, . V…