![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Anindya Bijoy Das
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j9]Myeung Suk Oh
, Anindya Bijoy Das
, Seyyedali Hosseinalipour
, Taejoon Kim
, David J. Love
, Christopher G. Brinton
:
A Decentralized Pilot Assignment Algorithm for Scalable O-RAN Cell-Free Massive MIMO. IEEE J. Sel. Areas Commun. 42(2): 373-388 (2024) - 2023
- [j8]Anindya Bijoy Das
, Aditya Ramamoorthy
, David J. Love
, Christopher G. Brinton
:
Distributed Matrix Computations With Low-Weight Encodings. IEEE J. Sel. Areas Inf. Theory 4: 363-378 (2023) - 2022
- [j7]Anindya Bijoy Das
, Aditya Ramamoorthy
:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. IEEE J. Sel. Areas Inf. Theory 3(2): 241-256 (2022) - [j6]Anindya Bijoy Das
, Aditya Ramamoorthy
:
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers. IEEE Trans. Inf. Theory 68(6): 4156-4181 (2022) - 2021
- [j5]Anindya Bijoy Das
, Aditya Ramamoorthy
, Namrata Vaswani
:
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. IEEE Trans. Inf. Theory 67(9): 6266-6282 (2021) - 2020
- [j4]Aditya Ramamoorthy
, Anindya Bijoy Das
, Li Tang
:
Straggler-Resistant Distributed Matrix Computation via Coding Theory: Removing a Bottleneck in Large-Scale Data Processing. IEEE Signal Process. Mag. 37(3): 136-145 (2020) - 2019
- [j3]Md Mosheyur Rahman, Mohammed Imamul Hassan Bhuiyan, Anindya Bijoy Das:
Classification of focal and non-focal EEG signals in VMD-DWT domain using ensemble stacking. Biomed. Signal Process. Control. 50: 72-82 (2019) - 2016
- [j2]Anindya Bijoy Das
, Mohammed Imamul Hassan Bhuiyan:
Discrimination and classification of focal and non-focal EEG signals using entropy-based features in the EMD-DWT domain. Biomed. Signal Process. Control. 29: 11-21 (2016) - [j1]Anindya Bijoy Das
, Mohammed Imamul Hassan Bhuiyan, S. M. Shafiul Alam:
Classification of EEG signals using normal inverse Gaussian parameters in the dual-tree complex wavelet transform domain for seizure detection. Signal Image Video Process. 10(2): 259-266 (2016)
Conference and Workshop Papers
- 2023
- [c10]Anindya Bijoy Das
, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. Allerton 2023: 1-8 - [c9]Satyavrat Wagle, Anindya Bijoy Das, David J. Love, Christopher G. Brinton:
A Reinforcement Learning-Based Approach to Graph Discovery in D2D-Enabled Federated Learning. GLOBECOM 2023: 225-230 - [c8]Anindya Bijoy Das
, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Coded Matrix Computations for D2D-Enabled Linearized Federated Learning. ICASSP 2023: 1-5 - [c7]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations with Low-weight Encodings. ISIT 2023: 1979-1984 - 2022
- [c6]Anindya Bijoy Das, Aditya Ramamoorthy:
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations. ISIT 2022: 1010-1015 - 2021
- [c5]Anindya Bijoy Das, Aditya Ramamoorthy:
Coded sparse matrix computation schemes that leverage partial stragglers. ISIT 2021: 1570-1575 - [c4]Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. ISIT 2021: 1724-1729 - [c3]Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. ITW 2021: 1-6 - 2019
- [c2]Anindya Bijoy Das
, Aditya Ramamoorthy:
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. ISIT 2019: 3022-3026 - 2018
- [c1]Anindya Bijoy Das
, Li Tang, Aditya Ramamoorthy:
C3LES: Codes for Coded Computation that Leverage Stragglers. ITW 2018: 1-5
Informal and Other Publications
- 2024
- [i14]Junghoon Kim, Taejoon Kim, Anindya Bijoy Das, Seyyedali Hosseinalipour, David J. Love, Christopher G. Brinton:
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches. CoRR abs/2401.00477 (2024) - [i13]Myeung Suk Oh, Anindya Bijoy Das, Taejoon Kim, David J. Love, Christopher G. Brinton:
Complexity Reduction in Machine Learning-Based Wireless Positioning: Minimum Description Features. CoRR abs/2402.09580 (2024) - [i12]Seohyun Lee, Anindya Bijoy Das, Satyavrat Wagle, Christopher G. Brinton:
Smart Information Exchange for Unsupervised Federated Learning via Reinforcement Learning. CoRR abs/2402.09629 (2024) - [i11]David Nickel, Anindya Bijoy Das, David J. Love, Christopher G. Brinton:
Multi-Agent Hybrid SAC for Joint SS-DSA in CRNs. CoRR abs/2404.14319 (2024) - [i10]Myeung Suk Oh, Anindya Bijoy Das, Taejoon Kim, David J. Love, Christopher G. Brinton:
Minimum Description Feature Selection for Complexity Reduction in Machine Learning-based Wireless Positioning. CoRR abs/2404.15374 (2024) - 2023
- [i9]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations with Low-weight Encodings. CoRR abs/2301.12685 (2023) - [i8]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Coded Matrix Computations for D2D-enabled Linearized Federated Learning. CoRR abs/2302.12305 (2023) - [i7]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. CoRR abs/2308.04331 (2023) - 2021
- [i6]Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. CoRR abs/2109.12070 (2021) - 2020
- [i5]Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang:
Straggler-resistant distributed matrix computation via coding theory. CoRR abs/2002.03515 (2020) - [i4]Anindya Bijoy Das, Aditya Ramamoorthy:
Coded sparse matrix computation schemes that leverage partial stragglers. CoRR abs/2012.06065 (2020) - 2019
- [i3]Anindya Bijoy Das, Aditya Ramamoorthy:
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. CoRR abs/1901.08716 (2019) - [i2]Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Random Convolutional Coding for Robust and Straggler Resilient Distributed Matrix Computation. CoRR abs/1907.08064 (2019) - 2018
- [i1]Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy:
C3LES: Codes for Coded Computation that Leverage Stragglers. CoRR abs/1809.06242 (2018)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05-31 01:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint