Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandeep Kumar 0005
Person information
- affiliation: Hong Kong University of Science and Technology, Department of Electronics and Communication Engineering, Hong Kong
- affiliation (PhD 2017): Indian Institute of Technology Kanpur, Department of Electrical Engineering, India
Other persons with the same name
- Sandeep Kumar — disambiguation page
- Sandeep Kumar 0001
![[0000-0003-4125-4165]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4125-4165")
(aka: Sandeep Kumar Poonia) — Jagannath University, Chaksu, Jaipur, Rajasthan, India - Sandeep Kumar 0002 — Indraprastha Institute of Information Technology (IIIT-D), Delhi, India
- Sandeep Kumar 0003 — National Institute of Technology Karnataka, India (and 2 more)
- Sandeep Kumar 0004 — Indian Institute of Technology Roorkee, Department of Computer Science and Engineering, India
- Sandeep Kumar 0006 — Bharat Electronics Ltd., Ghaziabad, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Manoj Kumar, Sandeep Kumar:
Unveiling Graph Structures for Machine Learning: Learning, Structuring, and Coarsening. COMAD/CODS 2024: 484-488- 2023
- [c11]Hugo Brehier, Arnaud Breloy, Mohammed Nabil El Korso, Sandeep Kumar:
Robust and Globally Sparse Pca via Majorization-Minimization and Variable Splitting. ICASSP 2023: 1-5 - [c10]José Vinícius de Miranda Cardoso, Jiaxi Ying, Sandeep Kumar, Daniel P. Palomar:
Estimating Normalized Graph Laplacians in Financial Markets. ICASSP 2023: 1-5 - 2021
- [j8]Arnaud Breloy, Sandeep Kumar, Ying Sun, Daniel P. Palomar:
Majorization-Minimization on the Stiefel Manifold With Application to Robust Sparse PCA. IEEE Trans. Signal Process. 69: 1507-1520 (2021) - [c9]Rui Zhou, Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Parameter Estimation for Student's t VAR Model with Missing Data. ICASSP 2021: 5145-5149 - 2020
- [j7]Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, Daniel P. Palomar:
A Unified Framework for Structured Graph Learning via Spectral Constraints. J. Mach. Learn. Res. 21: 22:1-22:60 (2020) - [j6]Rui Zhou, Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Student's $t$ VAR Modeling With Missing Data Via Stochastic EM and Gibbs Sampling. IEEE Trans. Signal Process. 68: 6198-6211 (2020)
2010 – 2019
- 2019
- [j5]Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Parameter Estimation of Heavy-Tailed AR Model With Missing Data Via Stochastic EM. IEEE Trans. Signal Process. 67(8): 2159-2172 (2019) - [j4]Licheng Zhao, Yiwei Wang, Sandeep Kumar, Daniel P. Palomar:
Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM. IEEE Trans. Signal Process. 67(16): 4231-4244 (2019) - [c8]Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, Daniel P. Palomar:
Bipartite Structured Gaussian Graphical Modeling via Adjacency Spectral Priors. ACSSC 2019: 322-326 - [c7]Rui Zhou, Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Robust Factor Analysis Parameter Estimation. EUROCAST (2) 2019: 3-11 - [c6]Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Parameter Estimation of Heavy-Tailed AR(p) Model from Incomplete Data. EUSIPCO 2019: 1-5 - [c5]Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, Daniel P. Palomar:
Structured Graph Learning Via Laplacian Spectral Constraints. NeurIPS 2019: 11647-11658 - [i5]Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, Daniel P. Palomar:
A Unified Framework for Structured Graph Learning via Spectral Constraints. CoRR abs/1904.09792 (2019) - [i4]Sandeep Kumar, Ketan Rajawat, Daniel P. Palomar:
Distributed Inexact Successive Convex Approximation ADMM: Analysis-Part I. CoRR abs/1907.08969 (2019) - [i3]Sandeep Kumar, Jiaxi Ying, José Vinícius de Miranda Cardoso, Daniel P. Palomar:
Structured Graph Learning Via Laplacian Spectral Constraints. CoRR abs/1909.11594 (2019) - 2018
- [c4]Junyan Liu, Sandeep Kumar, Daniel P. Palomar:
Parameter Estimation of Heavy-Tailed Random Walk Model from Incomplete Data. ICASSP 2018: 4439-4443 - 2017
- [j3]Sandeep Kumar, Rahul Jain, Ketan Rajawat:
Asynchronous Optimization Over Heterogeneous Networks Via Consensus ADMM. IEEE Trans. Signal Inf. Process. over Networks 3(1): 114-129 (2017) - [j2]Ketan Rajawat, Sandeep Kumar:
Stochastic Multidimensional Scaling. IEEE Trans. Signal Inf. Process. over Networks 3(2): 360-375 (2017) - [c3]Sandeep Kumar, Ketan Rajawat:
Distributed asynchronous localization over WSNs via non-convex consensus ADMM. NCC 2017: 1-6 - 2016
- [j1]Sandeep Kumar, Raju Kumar, Ketan Rajawat:
Cooperative Localization of Mobile Networks Via Velocity-Assisted Multidimensional Scaling. IEEE Trans. Signal Process. 64(7): 1744-1758 (2016) - [c2]Sandeep Kumar, Ketan Rajawat:
Distributed interference alignment for MIMO cellular network via consensus ADMM. GlobalSIP 2016: 460-464 - [i2]Sandeep Kumar, Rahul Jain, Ketan Rajawat:
Asynchronous Optimization Over Heterogeneous Networks via Consensus ADMM. CoRR abs/1605.00076 (2016) - [i1]Ketan Rajawat, Sandeep Kumar:
Stochastic Multidimensional Scaling. CoRR abs/1612.07089 (2016) - 2015
- [c1]Sandeep Kumar, Ketan Rajawat:
Velocity-assisted multidimensional scaling. SPAWC 2015: 570-574
Coauthor Index
aka: Daniel P. Palomar
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 17:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
