Browse by Subject Upper bound

Showing results 1 to 8 of 8

1
A Tighter Converse for the Locally Differentially Private Discrete Distribution Estimation Under the One-bit Communication Constraint

Nam, Seung-Hyun; Lee, Si-Hyeon, IEEE SIGNAL PROCESSING LETTERS, v.29, pp.1923 - 1927, 2022-09

2
Accelerating Finite Field Arithmetic for Homomorphic Encryption on GPUs

Neal Livesay; Jonatan, Gilbert; Evelio Mora; Kaustubh Shivdikar; Rashmi Agrawal; Ajay Joshi; Jose L. Abellan; et al, IEEE MICRO, v.43, no.5, pp.55 - 63, 2023-09

3
Fast localization with unknown transmit power and path-loss exponent in WSNs based on RSS measurements

Najarro, Lismer Andres Caceres; Song, Iickho; Tomic, Slavisa; Kim, Kiseon, IEEE COMMUNICATIONS LETTERS, v.24, no.12, pp.2756 - 2760, 2020-12

4
Multi-User Energy Beamforming for Different Energy Requests

Kang, Jinho; Choi, Junil; Choi, Wan, IEEE WIRELESS COMMUNICATIONS LETTERS, v.10, no.8, pp.1687 - 1691, 2021-08

5
New tight bound on the bit error probability for turbo codes = 터보부호에 관한 새로운 성능검증방법link

Hyun, Sung-Hwan; 현성환; et al, 한국정보통신대학원대학교, 2000

6
Optimal Private Discrete Distribution Estimation With 1-bit Communication

Nam, Seunghyun; Tan, Vincent Y. F.; Lee, Si-Hyeon, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, v.19, pp.6514 - 6528, 2024

7
Performance Analysis of Simultaneous Collision-Free Duplexing Method in Point-to-Multipoint Environment

Kim, Nam-, I; Cho, Dong-Ho, IEEE COMMUNICATIONS LETTERS, v.25, no.9, pp.2884 - 2888, 2021-09

8
The Balloon Popping Problem Revisited: Lower and Upper Bounds

Jung, Hyunwoo; Chwa, Kyung Yong, THEORY OF COMPUTING SYSTEMS, v.49, no.1, pp.182 - 195, 2011-07

rss_1.0 rss_2.0 atom_1.0