default search action
Saejoon Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Saejoon Kim, Hyuksoo Kim
:
Deep asset allocation for trend following investing. J. Exp. Theor. Artif. Intell. 34(4): 599-619 (2022)
2010 – 2019
- 2018
- [j24]Saejoon Kim:
Volatility forecasting for low-volatility portfolio selection in the US and the Korean equity markets. J. Exp. Theor. Artif. Intell. 30(1): 71-88 (2018) - [c11]Saejoon Kim, Soong Kim:
Regression-Based Estimation of Covariance Matrix of Stock Returns. FSDM 2018: 182-188 - 2017
- [j23]Saejoon Kim, Jun Heo:
Time series regression-based pairs trading in the Korean equities market. J. Exp. Theor. Artif. Intell. 29(4): 755-768 (2017) - 2014
- [j22]Saejoon Kim:
Margin-maximised redundancy-minimised SVM-RFE for diagnostic classification of mammograms. Int. J. Data Min. Bioinform. 10(4): 374-390 (2014) - [j21]Hyunseok Chang, Sae-Young Chung, Saejoon Kim:
Interference Channel With a Causal Relay Under Strong and Very Strong Interference. IEEE Trans. Inf. Theory 60(2): 859-865 (2014) - [j20]Kwangseok Noh, Saejoon Kim, Jun Heo:
Design of Systematic Unequal Error Protection Raptor Codes Over Binary Erasure Channels. Wirel. Pers. Commun. 75(4): 2513-2522 (2014) - 2013
- [j19]Jaeyoung Lee, Sung-Il Kim, Saejoon Kim, Jun Heo:
Random access transport capacity of multihop AF relaying: a throughput-reliability tradeoff. EURASIP J. Wirel. Commun. Netw. 2013: 104 (2013) - [j18]Sung-Il Kim, Saejoon Kim, Joon Tae Kim, Jun Heo:
Opportunistic Decode-and-Forward Relaying with Interferences at Relays. Wirel. Pers. Commun. 68(2): 247-264 (2013) - 2012
- [j17]Saejoon Kim:
Trapping Set Error Correction through Adaptive Informed Dynamic Scheduling Decoding of LDPC Codes. IEEE Commun. Lett. 16(7): 1103-1105 (2012) - [j16]Gil-Jin Jang, Saejoon Kim, Ji-Hwan Kim:
Minimum discrimination information-based language model adaptation using tiny domain corpora for intelligent personal assistants. IEEE Trans. Consumer Electron. 58(4): 1359-1365 (2012) - 2011
- [j15]Saejoon Kim, Jun Heo, Hyuncheol Park:
Improved Stopping Set Elimination by Parity-Check Matrix Extension of LDPC Codes. IEEE Commun. Lett. 15(5): 557-559 (2011) - [j14]Saejoon Kim, Seunghyuk Lee, Jun Heo, Jongho Nang:
On-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel. IEICE Trans. Commun. 94-B(4): 1062-1065 (2011) - [c10]Saejoon Kim:
Margin-maximized redundancy-minimized SVM-RFE for diagnostic classification of mammograms. BIBM Workshops 2011: 562-569 - 2010
- [j13]Saejoon Kim, Seunghyuk Lee, Jun Heo, Chong S. Rim:
Adaptive Mixed Scheduling for Correcting Errors in Trapping Sets of LDPC Codes. IEEE Commun. Lett. 14(7): 664-666 (2010) - [j12]Jongho Nang, Joohyoun Park, Jihoon Yang, Saejoon Kim:
A Hierarchical Bitmap Indexing Method for Similarity Search in High-Dimensional Multimedia Databases. J. Inf. Sci. Eng. 26(2): 393-407 (2010) - [j11]Sejong Yoon, Saejoon Kim:
k-Top Scoring Pair Algorithm for feature selection in SVM with applications to microarray data classification. Soft Comput. 14(2): 151-159 (2010) - [j10]Wonjin Lee, Kwangseok Noh, Saejoon Kim, Jun Heo:
Efficient cooperative transmission for wireless 3D HD video transmission in 60GHz channel. IEEE Trans. Consumer Electron. 56(4): 2481-2488 (2010) - [j9]Hyung-Tae Kim, Sung Hoon Lim
Code design for MIMO downlink with imperfect CSIT. IEEE Trans. Commun. 58(1): 89-94 (2010)
2000 – 2009
- 2009
- [j8]Saejoon Kim, Karam Ko, Jun Heo, Ji-Hwan Kim:
Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes. IEEE Commun. Lett. 13(3): 193-195 (2009) - [j7]Sejong Yoon, Saejoon Kim:
AdaBoost-based multiple SVM-RFE for classification of mammograms in DDSM. BMC Medical Informatics Decis. Mak. 9(S-1): S1 (2009) - [j6]Sejong Yoon, Saejoon Kim:
Mutual information-based SVM-RFE for diagnostic classification of digitized mammograms. Pattern Recognit. Lett. 30(16): 1489-1495 (2009) - [c9]Saejoon Kim:
Spectral Methods for Cancer Classification Using Microarray Data. CSO (1) 2009: 588-592 - [c8]Donghyuk Shin
Nearest Mean Classification via One-Class SVM. CSO (1) 2009: 593-596 - [c7]Sejong Yoon, Saejoon Kim:
Multiple SVM-RFE Using Boosting for Mammogram Classification. CSO (1) 2009: 740-742 - 2008
- [j5]Saejoon Kim, Karam Ko, Sae-Young Chung:
Incremental Gaussian elimination decoding of raptor codes over BEC. IEEE Commun. Lett. 12(4): 307-309 (2008) - [j4]Saejoon Kim, Seunghyuk Lee, Sae-Young Chung:
An efficient algorithm for ML decoding of raptor codes over the binary erasure channel. IEEE Commun. Lett. 12(8): 578-580 (2008) - [j3]Sung Won Kim, Sun Young Kim, Saejoon Kim, Jun Heo:
Performance analysis of forward error correcting codes in IPTV. IEEE Trans. Consumer Electron. 54(2): 376-380 (2008) - 2007
- [c6]Chulmin Yun, Donghyuk Shin
An Experimental Study on Feature Subset Selection Methods. CIT 2007: 77-82 - [c5]Sunku Kang, Byungwoo Lee, Jihoon Yang, Seonho Kim, Saejoon Kim:
Simulating Biological Pathways with a Continuous Petri Net Using Runge-Kutta Methods. FBIT 2007: 26-31 - [c4]Saejoon Kim:
A Graph-Theoretic Classification of Gene Expression Microarray Data of Cancer. FBIT 2007: 179-182 - [c3]Saejoon Kim, Sejong Yoon, Donghyuk Shin
Computer-Aided Diagnosis of Cross-Institutional Mammograms Using Support Vector Machines with Feature Elimination. FBIT 2007: 396-402 - [c2]Saejoon Kim, Donghyuk Shin
Classification of Normal and Tumor Tissues Using Geometric Representation of Gene Expression Microarray Data. MDAI 2007: 393-402 - 2006
- [c1]Saejoon Kim:
Turbo Decoding as an Instance of Expectation Maximization Algorithm. ICONIP (1) 2006: 371-378 - 2005
- [j2]Saejoon Kim:
Generalized minimum distance iterative decoding of Tanner codes. IEEE Commun. Lett. 9(8): 738-740 (2005) - 2004
- [j1]Saejoon Kim:
Protein ß-turn prediction using nearest-neighbor method. Bioinform. 20(1): 40-44 (2004)
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-25 05:42 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: