default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiayi Kang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Xiuqiong Chen
, Jiayi Kang, Stephen S.-T. Yau:
Time-varying feedback particle filter. Autom. 167: 111740 (2024)- [j5]Yangtianze Tao, Jiayi Kang, Stephen Shing-Toung Yau:
Neural Projection Filter: Learning Unknown Dynamics Driven by Noisy Observations. IEEE Trans. Neural Networks Learn. Syst. 35(7): 9508-9522 (2024) - [c3]Kelong Cong, Jiayi Kang, Georgio Nicolas, Jeongeun Park:
Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption. SCN (2) 2024: 3-23 - [i6]Kelong Cong, Jiayi Kang, Georgio Nicolas, Jeongeun Park:
Faster Private Decision Tree Evaluation for Batched Input from Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2024: 662 (2024) - [i5]Jacob A. Blindenbach, Jung Hee Cheon, Gamze Gürsoy, Jiayi Kang:
On the overflow and p-adic theory applied to homomorphic encryption. IACR Cryptol. ePrint Arch. 2024: 1353 (2024) - [i4]Mariana Gama, Emad Heydari Beni, Jiayi Kang, Jannik Spiessens, Frederik Vercauteren:
Blind zkSNARKs for Private Proof Delegation and Verifiable Computation over Encrypted Data. IACR Cryptol. ePrint Arch. 2024: 1684 (2024) - 2023
- [j4]Jiayi Kang, Andrew Salmon, Stephen S.-T. Yau:
Log-Concave Posterior Densities Arising in Continuous Filtering and a Maximum A Posteriori Algorithm. SIAM J. Control. Optim. 61(4): 2407-2424 (2023) - [j3]Jiayi Kang, Xiaopei Jiao, Stephen S.-T. Yau:
Finite Dimensional Estimation Algebra for Time-Varying Filtering System and Optimal Transport Particle Filter: A Tangent Flow Point of View. IEEE Trans. Aerosp. Electron. Syst. 59(6): 8005-8021 (2023) - [c2]Yangtianze Tao, Jiayi Kang, Stephen Shing-Toung Yau:
Maximum Correntropy Ensemble Kalman Filter. CDC 2023: 8659-8664 - [c1]Robin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. EUROCRYPT (3) 2023: 257-286 - [i3]Yangtianze Tao, Jiayi Kang, Stephen Shing-Toung Yau:
Maximum Correntropy Ensemble Kalman Filter. CoRR abs/2308.08727 (2023) - [i2]Kelong Cong, Robin Geelen, Jiayi Kang, Jeongeun Park:
Efficient and Secure k-NN Classification from Improved Data-Oblivious Programs and Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 852 (2023) - 2022
- [j2]Jiayi Kang, Xiuqiong Chen, Yangtianze Tao, Stephen Shing-Toung Yau:
Optimal Transportation Particle Filter for Linear Filtering Systems With Correlated Noises. IEEE Trans. Aerosp. Electron. Syst. 58(6): 5190-5203 (2022) - [i1]Robin Geelen, Ilia Iliashenko, Jiayi Kang, Frederik Vercauteren:
On Polynomial Functions Modulo pe and Faster Bootstrapping for Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022: 1364 (2022) - 2021
- [j1]Xiuqiong Chen, Jiayi Kang, Mina Teicher, Stephen S.-T. Yau:
A New Linear Regression Kalman Filter with Symmetric Samples. Symmetry 13(11): 2139 (2021)
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-11-08 20:25 CET 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:
