Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Yongkoo Han"'
Publikováno v:
Sensors, Vol 15, Iss 8, Pp 18209-18228 (2015)
The κ -Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors ( l-κNN) query, which finds the κ sensor node
Externí odkaz:
https://doaj.org/article/a1b3d75dd33f477887a491997e996e64
Publikováno v:
Sensors, Vol 12, Iss 5, Pp 5363-5379 (2012)
Activity monitoring of a person for a long-term would be helpful for controlling lifestyle associated diseases. Such diseases are often linked with the way a person lives. An unhealthy and irregular standard of living influences the risk of such dise
Externí odkaz:
https://doaj.org/article/c439059cfd2d4718bae3468716c44360
Autor:
Jaehun Bang, Taeho Hur, Dohyeong Kim, Thien Huynh-The, Jongwon Lee, Yongkoo Han, Oresti Banos, Jee-In Kim, Sungyoung Lee
Publikováno v:
Sensors, Vol 18, Iss 11, p 3744 (2018)
Personalized emotion recognition provides an individual training model for each target user in order to mitigate the accuracy problem when using general training models collected from multiple users. Existing personalized speech emotion recognition r
Externí odkaz:
https://doaj.org/article/bc3620776d4d474b9a94e7bf59a6c268
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 10 (2014)
Sensor-based activity recognition is attracting growing attention in many applications. Several studies have been performed to analyze activity patterns from an activity database gathered by activity recognition. Activity pattern classification is a
Externí odkaz:
https://doaj.org/article/ce48bc4058a4440dbfff8631859e492d
Autor:
Young-Koo Lee, Muhammad Umair, Yongkoo Han, Hyunwook Kim, Kifayat Ullah Khan, HoJin Seo, Kisung Park
Publikováno v:
The Journal of Supercomputing. 76:7906-7920
Graphs are widely used in various applications, and their size is becoming larger over the passage of time. It is necessary to reduce their size to minimize main memory needs and to save the storage space on disk. For these purposes, graph summarizat
Publikováno v:
Information Sciences. :201-215
The persistent alternation of the internet world is changing networks rapidly. Shortest path discovery, especially over dynamic networks such as web page links, telephone or route networks, and ontologies, has received intense attention because of it
Publikováno v:
Information Sciences. 336:1-20
Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus,
Autor:
Yongkoo Han1 ykhan@khu.ac.kr, Manhyung Han1 smiley@oslab.khu.ac.kr, Sungyoung Lee1 sylee@oslab.khu.ac.kr, A.M. Jehad Sarkar2 jehad@hufs.ac.kr, Young-Koo Lee1 yklee@khu.ac.kr
Publikováno v:
Sensors (14248220). 2012, Vol. 12 Issue 5, p5363-5379. 17p. 1 Color Photograph, 4 Diagrams, 4 Charts, 6 Graphs.
Publikováno v:
The Computer Journal. 58:1884-1893
Publikováno v:
Journal of Korea Multimedia Society. 14:1050-1060
With increasing need for indexing of persons in a large video database, automatic indexing has been attracting great interest which takes advantage of automatic tagging instead of the time-consuming and costly manual tagging. However, automatic index