default search action
Min-Hee Jang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j4]Min-Hee Jang, Sang-Wook Kim, Woong-Kee Loh, Jung-Im Won:
On approximate k-nearest neighbor searches based on the earth mover's distance for efficient content-based multimedia information retrieval. Comput. Sci. Inf. Syst. 16(2): 615-638 (2019) - 2018
- [c12]Min-Hee Jang, Sang-Wook Kim, Woong-Kee Loh, Jung-Im Won
:
Approximate k-Nearest Neighbor Search Based on the Earth Mover's Distance for Efficient Content-based Information Retrieval. WIMS 2018: 13:1-13:7 - 2016
- [c11]Min-Hee Jang, Christos Faloutsos, Sang-Wook Kim, U Kang, Jiwoon Ha:
PIN-TRUST: Fast Trust Propagation Exploiting Positive, Implicit, and Negative Information. CIKM 2016: 629-638 - [c10]Min-Hee Jang, Sang-Wook Kim, Jiwoon Ha:
Effectiveness of reverse edges and uncertainty in PIN-TRUST for trust prediction. EDB 2016: 81-85 - 2014
- [j3]Min-Hee Jang, Sang-Wook Kim, Christos Faloutsos
Accurate Approximation of the Earth Mover's Distance in Linear Time. J. Comput. Sci. Technol. 29(1): 142-154 (2014) - [c9]Min-Hee Jang, Christos Faloutsos
Trust prediction using positive, implicit, and negative information. WWW (Companion Volume) 2014: 303-304 - 2013
- [c8]Min-Hee Jang, Tae-Hwan Eom, Sang-Wook Kim, Young-Sup Hwang:
A semantic similarity measure in document databases: an earth mover's distance-based approach. RACS 2013: 94-99 - 2012
- [c7]Kyu-Hwang Kang, Seung-Hwan Lim, Sang-Wook Kim, Min-Hee Jang, Byeong-Soo Jeong:
A Topic-Oriented Analysis of Information Diffusion in a Blogosphere. DEXA (2) 2012: 129-140 - [c6]Jung-Im Won
Hierarchical data organization for effective retrieval of similar shaders. RACS 2012: 43-48 - 2011
- [c5]Min-Hee Jang, Sang-Wook Kim, Christos Faloutsos
A linear-time approximation of the earth mover's distance. CIKM 2011: 505-514 - [c4]Min-Hee Jang, Si-Yong Lee, Sang-Wook Kim, Myung-Cheol Roh, Jae-Ho Lee
On Extracting Perception-Based Features for Effective Similar Shader Retreival. COMPSAC 2011: 103-107 - 2010
- [j2]Sang-Wook Kim, Min-Hee Jang, Sungchae Lim:
Active Adjustment: An Effective Method for Keeping the TPR*-tree Compact. J. Inf. Sci. Eng. 26(5): 1583-1600 (2010)
2000 – 2009
- 2009
- [c3]Jae-Ho Lee, Min-Hee Jang, Du-Yeol Kim, Sang-Wook Kim, Min-Ho Kim, Jin-Sung Choi:
Shader space navigator: a turbo for an intuitive and effective shading process. SAC 2009: 945-946 - 2007
- [c2]Sang-Wook Kim, Min-Hee Jang, Sungchae Lim:
Active Adjustment: An Approach for Improving the Performance of the TPR*-Tree. DEXA 2007: 834-843 - [c1]Min-Hee Jang, Sang-Wook Kim, Miyoung Shin:
Performance of TPR*-Trees for Predicting Future Positions of Moving Objects in U-Cities. KES-AMSTA 2007: 841-850 - 2006
- [j1]Min-Hee Jang, Sang-Wook Kim:
Performance Evaluation of TPR: Trees for Processing Future-Time Queries in Moving Object Databases. J. Convergence Inf. Technol. 1(1): 12-19 (2006)
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-10-07 21:20 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: