default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKichang Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Sangbong Yoo, Kichang Kim
:
N-Dimensional Markov Chain Analysis of the Starvation Issue for IEEE 802.15.6 Slotted Aloha Algorithm. Wirel. Pers. Commun. 128(3): 1895-1906 (2023)- 2021
- [j7]Jinsoo Hwang, Jeankyung Kim, Inje Sung, Duckwhan Yoo, Kichang Kim:
Fast and Accurate Detection of Malicious Users in Cooperative Spectrum Sensing Network. Wirel. Pers. Commun. 118(2): 1709-1731 (2021) - 2020
- [j6]Jinsoo Hwang, Jeankyung Kim, Seunghwan Lee, Kichang Kim:
Two-Stage Ransomware Detection Using Dynamic Analysis and Machine Learning Techniques. Wirel. Pers. Commun. 112(4): 2597-2609 (2020)
2010 – 2019
- 2018
- [j5]Sangbong Yoo, Kichang Kim:
Analysis of Fairness Problem for IEEE 802.15.6 Slotted Aloha Algorithm. Wirel. Pers. Commun. 102(1): 559-581 (2018) - [c8]Hyosung Park, Chulwoo Park, Sangbong Yoo, Kichang Kim:
Detecting Vulnerable Java Classes Based on the Analysis of Java Library Call Graph. iThings/GreenCom/CPSCom/SmartData 2018: 1872-1879 - 2017
- [j4]Jinsoo Hwang, Jeankyung Kim, Kichang Kim:
Beta-Decrement of Contention Probability to Enhance Both Fairness and Throughput in IEEE 802.15.6 Slotted Aloha Algorithm. Wirel. Pers. Commun. 97(2): 2053-2067 (2017) - 2016
- [j3]Jeankyung Kim, Jinsoo Hwang, Kichang Kim:
High-Performance Internet Traffic Classification Using a Markov Model and Kullback-Leibler Divergence. Mob. Inf. Syst. 2016: 6180527:1-6180527:13 (2016) - [c7]Kichang Kim, Akihiko Torii, Masatoshi Okutomi:
Multi-view Inverse Rendering Under Arbitrary Illumination and Albedo. ECCV (3) 2016: 750-767 - 2015
- [c6]Kichang Kim, Akihiko Torii, Masatoshi Okutomi:
Joint Estimation of Depth, Reflectance and Illumination for Depth Refinement. ICCV Workshops 2015: 199-207 - 2013
- [j2]Kichang Kim, Jeankyung Kim, Jinsoo Hwang:
IP traceback with sparsely-tagged fragment marking scheme under massively multiple attack paths. Clust. Comput. 16(2): 229-239 (2013) - [c5]Kichang Kim, Takayuki Sugiura, Akihiko Torii, Shigeki Sugimoto, Masatoshi Okutomi:
Instant Surface Reconstruction for Incremental SfM. MVA 2013: 371-374 - 2012
- [j1]Jinsoo Hwang, Jeankyung Kim, Kichang Kim:
Analysis of the false-positive error rate of tagged fragment marking scheme. Inf. Process. Lett. 112(6): 227-232 (2012)
2000 – 2009
- 2007
- [c4]Byungryong Kim, Kichang Kim:
Efficient Search Technique for Agent-Based P2P Information Retrieval. AIS-ADM 2007: 275-286 - [c3]Byungryong Kim, Kichang Kim:
Distance-Based Bloom Filter for an Efficient Search in Mobile Ad Hoc Networks. HCI (8) 2007: 471-479 - [c2]Byungryong Kim, Kichang Kim:
Keyword Search in DHT-Based Peer-to-Peer Networks. ICA3PP 2007: 338-347 - 2006
- [c1]Jeankyung Kim, Jinsoo Hwang, Byungryong Kim, Kichang Kim:
Proving Optimality of DWS(Distance-Weighted Sampling) Probability Function for FMS IP Trace-Back Technique. ICDCN 2006: 133-138
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-04-24 23:02 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:
