Random Cubic Planar Graphs Manuel Bodirsky,1, * Mihyun Kang,1, † Mike Löffler,1 Colin McDiarmid2 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, DBerlin, Germany;

Source URL: www.math.tugraz.at

Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation U Kang Brendan Meeder

Source URL: www.cs.cmu.edu

Development of a Transportable Atom Gravimeter in HUST Yao-Yao Xu1 , Xiao-Chun Duan1 , Min-Kang Zhou1 , Jia-Feng Cui1 , Hui-Bin Yao1 , Xin Xiong1 , and Zhong-Kun Hu1 1

Source URL: www.egas.lu.lv

On the Connectivity Threshold of Achlioptas Processes Mihyun Kang∗ Konstantinos Panagiotou† July 28, 2014

Source URL: www.math.tugraz.at

Designing Future Warehouse-Scale Computers for Sirius, an End-to-End Voice and Vision Personal Assistant JOHANN HAUSWALD, MICHAEL A. LAURENZANO, YUNQI ZHANG, HAILONG YANG, YIPING KANG, CHENG LI, AUSTIN ROVINSKI, ARJUN KH

Source URL: web.eecs.umich.edu

Towards Understanding Relational Orientation: Attachment Theory and Facebook Activities Bumsoo Kang KAIST Republic of Korea

Source URL: uilab.kaist.ac.kr

Immersive Recommendation: News and Event Recommendations Using Personal Digital Traces Cheng-Kang Hsieh Longqi Yang

Source URL: www2016.net

• Software
• Computing
• Digital media
• Social networking services
• Social information processing
• Social media
• Collective intelligence
• Statistical natural language processing
• Recommender system
• Collaborative filtering
• Latent Dirichlet allocation
• Topic model

arXiv:1412.6366v1 [math.CO] 19 DecLARGEST COMPONENTS IN RANDOM HYPERGRAPHS OLIVER COOLEY, MIHYUN KANG, AND YURY PERSON Abstract. In this paper we consider j-tuple-connected components in random k-uniform hypergrap

Source URL: arxiv.org

Asymptotic properties of graphs on orientable surfaces Mihyun Kang Doctoral School Discrete Mathematics

Source URL: www.math.tugraz.at

UNTANGLING PLANAR GRAPHS FROM A SPECIFIED VERTEX POSITION — HARD CASES M. KANG, O. PIKHURKO∗, A. RAVSKY, M. SCHACHT, AND O. VERBITSKY † Abstract. Given a planar graph G, we consider drawings of G in the plane where

Source URL: homepages.warwick.ac.uk