default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNiladri Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Jed A. Duersch
, Tommie A. Catanach, Niladri Das:
Logical activation functions for training arbitrary probabilistic Boolean operations. Inf. Sci. 664: 120304 (2024)- [i17]Niladri Das:
Smart Portable Computer. CoRR abs/2405.05292 (2024) - [i16]Niladri Das, Ross Guttromson, Tommie A. Catanach:
Development of Bayesian Component Failure Models in E1 HEMP Grid Analysis. CoRR abs/2406.01923 (2024) - 2023
- [c13]Tommie A. Catanach, Niladri Das:
Metrics for Bayesian Optimal Experiment Design Under Model Misspecification. CDC 2023: 7707-7714 - [c12]Niladri Das, B. Sundar Rajan:
A Shared Cache Coded Caching Scheme Using Designs and Circuits of Matrices. ITW 2023: 131-135 - [i15]Tommie A. Catanach, Niladri Das:
Metrics for Bayesian Optimal Experiment Design under Model Misspecification. CoRR abs/2304.07949 (2023) - 2022
- [j8]Niladri Das, Raktim Bhattacharya:
Optimal Sensor Precision for Multirate Sensing for Bounded Estimation Error. IEEE Trans. Aerosp. Electron. Syst. 58(2): 844-854 (2022) - [c11]Niladri Das, Jed A. Duersch, Tommie A. Catanach:
Variational Kalman Filtering with H∞-Based Correction for Robust Bayesian Learning in High Dimensions. CDC 2022: 7522-7528 - [c10]Niladri Das, B. Sundar Rajan:
Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs. ISIT 2022: 1719-1724 - [i14]Niladri Das, B. Sundar Rajan:
Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs. CoRR abs/2202.05515 (2022) - [i13]Jed A. Duersch, Thomas A. Catanach, Niladri Das:
Adaptive n-ary Activation Functions for Probabilistic Boolean Logic. CoRR abs/2203.08977 (2022) - [i12]Niladri Das, Jed A. Duersch, Thomas A. Catanach:
Variational Kalman Filtering with Hinf-Based Correction for Robust Bayesian Learning in High Dimensions. CoRR abs/2204.13089 (2022) - [i11]Niladri Das, B. Sundar Rajan:
Shared Cache Coded Caching Schemes Using Designs and Circuits of Matrices. CoRR abs/2212.14410 (2022) - 2021
- [j7]Niladri Das, Raktim Bhattacharya:
Privacy and Utility Aware Data Sharing for Space Situational Awareness From Ensemble and Unscented Kalman Filtering Perspective. IEEE Trans. Aerosp. Electron. Syst. 57(2): 1162-1176 (2021) - [i10]Niladri Das, Raktim Bhattacharya:
Optimal Sensor Precision for Multi-Rate Sensing for Bounded Estimation Error. CoRR abs/2106.06906 (2021) - 2020
- [j6]Niladri Das, Brijesh Kumar Rai:
Characteristic Sets of Fixed-Dimension Vector Linear Codes for Non-Multicast Networks. IEEE Trans. Inf. Theory 66(12): 7408-7426 (2020) - [c9]Niladri Das, Raktim Bhattacharya:
Utility and Privacy in Object Tracking from Video Stream using Kalman Filter. FUSION 2020: 1-6 - [i9]Vinicius G. Goecks, Grayson Woods, Niladri Das, John Valasek:
Combining Visible and Infrared Spectrum Imagery using Machine Learning for Small Unmanned Aerial System Detection. CoRR abs/2003.12638 (2020) - [i8]Sunsoo Kim, Niladri Das, Raktim Bhattacharya:
Modeling and Optimal Control of Hybrid UAVs with Wind Disturbance. CoRR abs/2006.11192 (2020)
2010 – 2019
- 2019
- [j5]Niladri Das, Brijesh Kumar Rai:
Vector Linear Solution iff Dimension ≥ m. IEEE Commun. Lett. 23(9): 1470-1473 (2019) - [i7]Niladri Das, Brijesh Kumar Rai:
Linear Network Coding: Effects of Varying the Message Dimension on the Set of Characteristics. CoRR abs/1901.04820 (2019) - 2018
- [c8]Niladri Das, Brijesh Kumar Rai:
On the Power of Vector Linear Network Coding. ISITA 2018: 232-236 - 2017
- [j4]Niladri Das, Brijesh Kumar Rai:
On achievability of an ( r , l ) fractional linear network code. IET Networks 6(3): 54-61 (2017) - [j3]Brijesh Kumar Rai, Niladri Das:
On characteristics dependent linear coding capacity of sum-networks. IET Networks 6(5): 133-137 (2017) - [c7]Niladri Das, Brijesh Kumar Rai:
Generalized Fano and non-Fano networks. NCC 2017: 1-6 - [c6]Niladri Das, Brijesh Kumar Rai:
On fractional linear network coding solution of multiple-unicast networks. NCC 2017: 1-6 - [c5]Niladri Das, Brijesh Kumar Rai:
Sum-networks: Dependency on characteristic of the finite field under linear network coding. NCC 2017: 1-6 - [i6]Niladri Das, Brijesh Kumar Rai:
On the Dependence of Linear Coding Rates on the Characteristic of the Finite Field. CoRR abs/1709.05970 (2017) - 2016
- [j2]Niladri Das, Brijesh Kumar Rai:
On the Message Dimensions of Vector Linearly Solvable Networks. IEEE Commun. Lett. 20(9): 1701-1704 (2016) - [i5]Niladri Das, Brijesh Kumar Rai:
On the Message Dimensions of Vector Linearly Solvable Networks. CoRR abs/1606.05904 (2016) - [i4]Niladri Das, Brijesh Kumar Rai:
On Achievability of an (r, l) Fractional Linear Network Code. CoRR abs/1607.01736 (2016) - [i3]Niladri Das, Brijesh Kumar Rai:
Generalized Fano and non-Fano networks. CoRR abs/1609.05815 (2016) - [i2]Niladri Das, Brijesh Kumar Rai:
On Fractional Linear Network Coding Solution of Multiple-Unicast Networks. CoRR abs/1610.08004 (2016) - [i1]Niladri Das, Brijesh Kumar Rai:
Sum-networks: Dependency on Characteristic of the Finite Field under Linear Network Coding. CoRR abs/1610.08408 (2016) - 2015
- [c4]Niladri Das, Samrat Dutta, Sunil Kumar Reddy, Laxmidhar Behera:
A probabilistic framework of learning movement primitives from unstructured demonstrations. INDIN 2015: 332-337 - [c3]Niladri Das, Brijesh Kumar Rai:
On the number of sources and terminals of sum-networks with capacity p/q. NCC 2015: 1-6 - 2013
- [j1]Brijesh Kumar Rai, Niladri Das:
Sum-Networks: Min-Cut = 2 Does Not Guarantee Solvability. IEEE Commun. Lett. 17(11): 2144-2147 (2013) - [c2]Brijesh Kumar Rai, Niladri Das:
On the capacity of sum-networks. Allerton 2013: 1545-1552 - [c1]Brijesh Kumar Rai, Niladri Das:
On the capacity of ms/3t and 3s/nt sum-networks. ITW 2013: 1-5
Coauthor Index
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-07-05 20:17 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:
