Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Harsh Singhal"'
Publikováno v:
International Statistical Review. 90:468-480
Publikováno v:
2021 International Conference on Computational Intelligence and Computing Applications (ICCICA).
Autor:
George Michailidis, Harsh Singhal
Publikováno v:
IEEE Transactions on Information Theory. 57:5054-5071
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 n
Publikováno v:
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews). 40:319-329
As electronic records (e.g., medical records and technical defect records) accumulate, the retrieval of a record from a past instance with the same or similar circumstances, has become extremely valuable. This is because a past record may contain the
Publikováno v:
NeuroImage. 40:1157-1165
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 tes
Autor:
George Michailidis, Harsh Singhal
Publikováno v:
Inverse Problems. 23:1821-1849
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 th
Publikováno v:
IETE Journal of Research. 51:163-169
Low density parity check (LDPC) codes are a class of very powerful error correcting codes. While LDPC codes already have a rich theory, issues specific to implementation are an active area of research. In this paper we look at the issue of designing
Autor:
Harsh Singhal, George Michailidis
Publikováno v:
Ann. Appl. Stat. 4, no. 1 (2010), 78-93
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. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::404626b7f168a6f6638c96dac8af37b2
http://projecteuclid.org/euclid.aoas/1273584448
http://projecteuclid.org/euclid.aoas/1273584448
Autor:
George Michailidis, Harsh Singhal
Publikováno v:
SIGMETRICS
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