#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2007

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert Buck, Harsh Singhal, Jagriti Arora, Heidi Schlitt, R. Todd Constable
- NeuroImage
- 2008

An algorithm using pre-defined regions of interest (ROIs) to detect differences between sessions in Blood Oxygen-Level Dependent (BOLD) signal is proposed and results from a reproducibility study are reported here. It is important to know whether tests for change have the desired statistical properties, e.g., low variability between sessions and unbiased… (More)

- Harsh Singhal, George Michailidis
- SIGMETRICS
- 2008

Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling rates result in large noise in traffic volume estimates. We propose to combine data on individual flows obtained from sampling with highly aggregate data obtained from SNMP… (More)

We study the problem of identifiability of distributions of flows on a graph from aggregate measurements collected on its edges. This is a canonical example of a statistical inverse problem motivated by recent developments in computer networks. In this paper (i) we introduce a number of models for multi-modal data that capture their spatio-temporal… (More)

- Harsh Singhal, George Michailidis
- IEEE Transactions on Information Theory
- 2011

We propose models for the joint distribution of two modalities for network flow volumes. While these models are motivated by computer network applications, the underlying structural assumptions are more generally applicable. In the case of computer network flow volumes, this corresponds to joint modeling for packet and byte volumes and enables computer… (More)

- Andrew Rodriguez, W. Art Chaovalitwongse, Zhe Liang, Harsh Singhal, Hoang Pham
- IEEE Trans. Systems, Man, and Cybernetics, Part C
- 2010

We examine the problem of optimal design in the context of filtering multiple random walks. Specifically, we define the steady state E-optimal design criterion and show that the underlying optimization problem leads to a second order cone program. The developed methodology is applied to tracking network flow volumes using sampled data, where the design… (More)

We study the problem of identifiability of distributions of flows on a graph from aggregate measurements collected on its edges. This is a canonical example of a statistical inverse problem motivated by recent developments in computer networks. In this paper (i) we introduce a number of models for multi-modal data that capture their spatio-temporal… (More)

- Yan Lan, George Michailidis, +4 authors Aijun Zhang
- 2007

To my parents ii ACKNOWLEDGEMENTS My foremost thanks go to my advisors Dr. George Michailidis and Dr. Moulinath Banerjee. I thank them for their advice, patience, support, encouragement, insights and suggestions that helped shape my research skills. This thesis would not be possible without them. I am grateful to my two other committee members, Dr. for… (More)

- ‹
- 1
- ›