default search action
Jun Luo 0008
Person information
- affiliation: Chinese Academy of Sciences, Shenzhen Institutes of Advanced Technology, Shenzhen, China
Other persons with the same name
- Jun Luo — disambiguation page
- Jun Luo 0001 — Nanyang Technological University, School of Computer Science and Engineering, Singapore
- Jun Luo 0002 (aka: Jia-Jun Luo) — Chinese Academy of Sciences, Institute of Microelectronics, Beijing, China
- Jun Luo 0003 — Chongqing University, School of Computer Science, Chongqing, China
- Jun Luo 0004 — Harbin Institute of Technology, Department of Electrical Engineering, Harbin, China
- Jun Luo 0005 — Hohai University, Nanjing, China (and 1 more)
- Jun Luo 0006 — Chongqing University, College of Mechanical Engineering, State Key Laboratory of Mechanical Transmission, China (and 1 more)
- Jun Luo 0007 — Machine Intelligence Center Lenovo Group Limited, Hong Kong, China (and 1 more)
- Jun Luo 0009 — Huawei Technologies Canada, Noah's Ark Lab, Toronto, Canada
- Jun Luo 0010 — University of Pittsburgh, Intelligent Systems Program, School of Computing and Information, PA, USA,
- Jun Luo 0011 — National University of Defense Technology, School of Computer Science, Changsha, Hunan, China (and 1 more)
- Jun Luo 0012 — Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j19]Chao Li, Yeyu Yan, Zhongying Zhao, Jun Luo, Qingtian Zeng:
HEPre: Click frequency prediction of applications based on heterogeneous information network embedding. J. Intell. Fuzzy Syst. 41(6): 7511-7526 (2021)
2010 – 2019
- 2015
- [j18]Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected computations on color spanning sets. J. Comb. Optim. 29(3): 589-604 (2015) - [j17]Zhongying Zhao, Chao Li, Yong Zhang, Joshua Zhexue Huang, Jun Luo, Shengzhong Feng, Jianping Fan:
Identifying and Analyzing Popular Phrases Multi-Dimensionally in Social Media Data. Int. J. Data Warehous. Min. 11(3): 98-112 (2015) - 2014
- [j16]Chenglin Fan, Jun Luo, Wencheng Wang, Farong Zhong, Binhai Zhu:
On Some Proximity Problems of Colored Sets. J. Comput. Sci. Technol. 29(5): 879-886 (2014) - [j15]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi diagram with visual restriction. Theor. Comput. Sci. 532: 31-39 (2014) - [c31]Chao Li, Zhongying Zhao, Jun Luo, Ling Yin, Qiming Zhou:
A Spatial-Temporal Analysis of Users' Geographical Patterns in Social Media: A Case Study on Microblogs. DASFAA Workshops 2014: 296-307 - [c30]Fang Zhang, Jun Luo, Chao Li, Xin Wang, Zhongying Zhao:
Detecting and Analyzing Influenza Epidemics with Social Media in China. PAKDD (1) 2014: 90-101 - 2013
- [j14]Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu:
On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013) - [j13]Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu:
Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. 26(4): 832-859 (2013) - [j12]Binhai Zhu, Jun Luo:
Preface. Theor. Comput. Sci. 508: 1 (2013) - [c29]Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected Computations on Color Spanning Sets. FAW-AAIM 2013: 130-141 - [c28]Chenglin Fan, Jun Luo, Farong Zhong:
On Some Proximity Problems of Colored Sets. COCOA 2013: 202-213 - [c27]Chenglin Fan, Jun Luo, Binhai Zhu:
Tight Approximation Bounds for Connectivity with a Color-Spanning Set. ISAAC 2013: 590-600 - 2012
- [j11]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira:
Processing aggregated data: the location of clusters in health data. GeoInformatica 16(3): 497-521 (2012) - [c26]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi Diagram with Visual Restriction. FAW-AAIM 2012: 36-46 - [c25]Chao Li, Zhongying Zhao, Shuguang Liu, Ling Yin, Jun Luo:
Relationships between geographical cluster and cyberspace community: A case study on microblog. Geoinformatics 2012: 1-5 - [c24]Chao Li, Jun Luo, Joshua Zhexue Huang, Jianping Fan:
Multi-Layer Network for Influence Propagation over Microblog. PAISI 2012: 60-72 - 2011
- [j10]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo:
Finding long and similar parts of trajectories. Comput. Geom. 44(9): 465-476 (2011) - [j9]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. Int. J. Comput. Geom. Appl. 21(3): 253-282 (2011) - [j8]Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo:
Geodesic Disks and Clustering in a Simple Polygon. Int. J. Comput. Geom. Appl. 21(6): 595-608 (2011) - [j7]Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3(1): 3-31 (2011) - [j6]Chenglin Fan, Jun Luo, Binhai Zhu:
Continuous-Time Moving Network Voronoi Diagram. Trans. Comput. Sci. 14: 129-150 (2011) - [c23]Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu:
On Some Geometric Problems of Color-Spanning Sets. FAW-AAIM 2011: 113-124 - [c22]Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu:
Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON 2011: 192-203 - [c21]Tim Wylie, Jun Luo, Binhai Zhu:
A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance. ICCSA (3) 2011: 74-83 - [c20]Chao Li, Zhongying Zhao, Jun Luo, Jianping Fan:
Info-Cluster Based Regional Influence Analysis in Social Networks. PAKDD (2) 2011: 87-98 - [c19]Atlas F. Cook, Chenglin Fan, Jun Luo:
Hide-and-Seek: Algorithms for Polygon Walk Problems. TAMC 2011: 495-504 - 2010
- [j5]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Finding the Most Relevant Fragments in Networks. J. Graph Algorithms Appl. 14(2): 307-336 (2010) - [c18]Chenglin Fan, Jun Luo:
Point Location in the Continuous-Time Moving Network. AAIM 2010: 131-140 - [c17]Chenglin Fan, Jun Luo, Binhai Zhu:
Fréchet-Distance on Road Networks. CGGA 2010: 61-72 - [c16]Ovidiu Daescu, Wenqi Ju, Jun Luo:
NP-Completeness of Spreading Colored Points. COCOA (1) 2010: 41-50 - [c15]Jin Chang, Jun Luo, Joshua Zhexue Huang, Shengzhong Feng, Jianping Fan:
Minimum Spanning Tree Based Classification Model for Massive Data with MapReduce Implementation. ICDM Workshops 2010: 129-137 - [c14]Chenglin Fan, Jianbiao He, Jun Luo, Binhai Zhu:
Moving Network Voronoi Diagram. ISVD 2010: 142-150 - [c13]Haohan Zhu, Jun Luo, Hang Yin, Xiaotao Zhou, Joshua Zhexue Huang, F. Benjamin Zhan:
Mining Trajectory Corridors Using Fréchet Distance and Meshing Grids. PAKDD (1) 2010: 228-237
2000 – 2009
- 2009
- [j4]Ovidiu Daescu, Jun Luo:
Stabbing balls and simplifying proteins. Int. J. Bioinform. Res. Appl. 5(1): 64-80 (2009) - [j3]Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi:
Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4): 469-478 (2009) - [c12]Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann, Thomas Wolle:
Detecting Hotspots in Geographic Networks. AGILE Conf. 2009: 217-231 - [c11]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Jun Luo:
Finding long and similar parts of trajectories. GIS 2009: 296-305 - [c10]Boris Aronov, Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann:
Connect the Dot: Computing Feed-Links with Minimum Dilation. WADS 2009: 49-60 - 2008
- [c9]Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo:
Detecting Commuting Patterns by Clustering Subtrajectories. ISAAC 2008: 644-655 - [c8]Jun Luo, Christian Wulff-Nilsen:
Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces. ISAAC 2008: 764-775 - [c7]Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira:
Clusters in Aggregated Health Data. SDH 2008: 77-90 - 2007
- [c6]Marc J. van Kreveld, Jun Luo:
The definition and computation of trajectory and subtrajectory similarity. GIS 2007: 44 - [c5]Magdalene G. Borgelt, Marc J. van Kreveld, Jun Luo:
Geodesic Disks and Clustering in a Simple Polygon. ISAAC 2007: 656-667 - [c4]Ovidiu Daescu, Jun Luo:
Computing Simple Paths on Points in Simple Polygons. KyotoCGGT 2007: 41-55 - 2006
- [j2]Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity problems on line segments spanned by points. Comput. Geom. 33(3): 115-129 (2006) - [j1]Ovidiu Daescu, Jun Luo:
Cutting out Polygons with Lines and Rays. Int. J. Comput. Geom. Appl. 16(2-3): 227-248 (2006) - 2005
- [c3]Ramaswamy Chandrasekaran, Ovidiu Daescu, Jun Luo:
Cutting Out Polygons. CCCG 2005: 183-186 - [c2]Ovidiu Daescu, Jun Luo, David M. Mount:
Proximity Problems on Line Segments Spanned by Points. CCCG 2005: 227-231 - 2004
- [c1]Ovidiu Daescu, Jun Luo:
Cutting Out Polygons with Lines and Rays. ISAAC 2004: 669-680
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-11-11 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint