default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun-Gi Jang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Jun-Gi Jang
, Yong-chan Park, U Kang:
Fast and Accurate PARAFAC2 Decomposition for Time Range Queries on Irregular Tensors. CIKM 2024: 962-972- [c11]Junghun Kim, Ka Hyun Park, Jun-Gi Jang, U Kang:
Fast and Accurate Domain Adaptation for Irregular Tensor Decomposition. KDD 2024: 1383-1394 - [c10]Taehyung Kwon, Jihoon Ko, Jinhong Jung, Jun-Gi Jang, Kijung Shin:
Compact Decomposition of Irregular Tensors for Data Compression: From Sparse to Dense to High-Order Tensors. KDD 2024: 1451-1462 - 2023
- [j7]Jun-Gi Jang, Chun Quan, Hyun Dong Lee, U Kang:
Falcon: lightweight and accurate convolution based on depthwise separable convolution. Knowl. Inf. Syst. 65(5): 2225-2249 (2023) - [j6]Jun-Gi Jang, U Kang:
Static and Streaming Tucker Decomposition for Dense Tensors. ACM Trans. Knowl. Discov. Data 17(5): 66:1-66:34 (2023) - [j5]Jun-Gi Jang, Sooyeon Shim, Vladimir Egay, Jeeyong Lee, Jongmin Park, Suhyun Chae, U Kang:
Accurate Open-Set Recognition for Memory Workload. ACM Trans. Knowl. Discov. Data 17(9): 126:1-126:14 (2023) - [c9]Jun-Gi Jang, Jeongyoung Lee, Yong-chan Park, U Kang:
Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors - Algorithm and Application. KDD 2023: 879-890 - [i11]Jun-Gi Jang, Jeongyoung Lee, Yong-chan Park, U Kang:
Fast and Accurate Dual-Way Streaming PARAFAC2 for Irregular Tensors - Algorithm and Application. CoRR abs/2305.18376 (2023) - 2022
- [j4]Dawon Ahn, Jun-Gi Jang, U Kang:
Time-aware tensor decomposition for sparse tensors. Mach. Learn. 111(4): 1409-1430 (2022) - [j3]Jun-Gi Jang, Moonjeong Park, Jongwuk Lee, Lee Sael:
Large-scale tucker Tensor factorization for sparse and accurate decomposition. J. Supercomput. 78(16): 17992-18022 (2022) - [j2]Jun-Gi Jang, Chaeheum Park, Changwon Jang, Geonsoo Kim, U Kang:
Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization. ACM Trans. Knowl. Discov. Data 16(6): 115:1-115:21 (2022) - [c8]Jun-Gi Jang, Jeongyoung Lee, Jiwon Park, U Kang:
Accurate PARAFAC2 Decomposition for Temporal Irregular Tensors with Missing Values. IEEE Big Data 2022: 982-991 - [c7]Jun-Gi Jang, U Kang:
DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensors. ICDE 2022: 2454-2467 - [i10]Jun-Gi Jang, U Kang:
DPar2: Fast and Scalable PARAFAC2 Decomposition for Irregular Dense Tensors. CoRR abs/2203.12798 (2022) - [i9]Hyunsik Jeon, Jun-Gi Jang, Taehun Kim, U Kang:
Accurate Bundle Matching and Generation via Multitask Learning with Partially Shared Parameters. CoRR abs/2210.15460 (2022) - [i8]Jun-Gi Jang, Sooyeon Shim, Vladimir Egay, Jeeyong Lee, Jongmin Park, Suhyun Chae, U Kang:
Accurate Open-set Recognition for Memory Workload. CoRR abs/2212.08817 (2022) - 2021
- [c6]Moonjeong Park, Jun-Gi Jang, Lee Sael:
VEST: Very Sparse Tucker Factorization of Large-Scale Tensors. BigComp 2021: 172-179 - [c5]Dawon Ahn, Jun-Gi Jang, U Kang:
Time-Aware Tensor Decomposition for Sparse Tensors. DSAA 2021: 1-2 - [c4]Jun-Gi Jang, U Kang:
Fast and Memory-Efficient Tucker Decomposition for Answering Diverse Time Range Queries. KDD 2021: 725-735 - [c3]Yong-chan Park, Jun-Gi Jang, U Kang:
Fast and Accurate Partial Fourier Transform for Time Series Data. KDD 2021: 1309-1318 - 2020
- [c2]Jun-Gi Jang, U Kang:
D-Tucker: Fast and Memory-Efficient Tucker Decomposition for Dense Tensors. ICDE 2020: 1850-1853 - [i7]Yong-chan Park, Jun-Gi Jang, U Kang:
Fast Partial Fourier Transform. CoRR abs/2008.12559 (2020) - [i6]Dawon Ahn, Jun-Gi Jang, U Kang:
Time-Aware Tensor Decomposition for Missing Entry Prediction. CoRR abs/2012.08855 (2020) - [i5]Jun-Gi Jang, Chaeheum Park, Changwon Jang, Geonsoo Kim, U Kang:
Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization. CoRR abs/2012.12487 (2020)
2010 – 2019
- 2019
- [j1]Sejoon Oh, Namyong Park, Jun-Gi Jang, Lee Sael, U Kang:
High-Performance Tucker Factorization on Heterogeneous Platforms. IEEE Trans. Parallel Distributed Syst. 30(10): 2237-2248 (2019) - [i4]Moonjeong Park, Jun-Gi Jang, Lee Sael:
VeST: Very Sparse Tucker Factorization of Large-Scale Tensors. CoRR abs/1904.02603 (2019) - [i3]Chun Quan, Jun-Gi Jang, Hyun Dong Lee, U Kang:
FALCON: Fast and Lightweight Convolution for Compressing and Accelerating CNN. CoRR abs/1909.11321 (2019) - 2018
- [c1]Jun-Gi Jang, Dongjin Choi, Jinhong Jung, U Kang:
Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range. CIKM 2018: 1083-1092 - [i2]Jun-Gi Jang, Dongjin Choi, Jinhong Jung, U Kang:
TR-SVD: Fast and Memory Efficient Method for Time Ranged Singular Value Decomposition. CoRR abs/1805.00754 (2018) - 2017
- [i1]Dongjin Choi, Jun-Gi Jang, U Kang:
Fast, Accurate, and Scalable Method for Sparse Coupled Matrix-Tensor Factorization. CoRR abs/1708.08640 (2017)
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 2025-01-21 00:02 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:
