◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jing Tang

The Hong Kong University of Science and Technology (Guangzhou)

20 papers hereh-index 201.6k citations55 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author12
  • last author3

Across the 19 of 20 papers where every author was matched, so the position is known.

fields
  • cs.SI7
  • cs.DS6
  • cs.CR2
  • cs.LG2
  • cs.CL1
  • cs.CV1
affiliations
  • The Hong Kong University of Science and Technology (Guangzhou)
  • The Hong Kong University of Science and Technology
Homepage
same name
  • Jing Tang — 18 papers, h 5
  • Jing Tang — 11 papers, h 9
  • Jing Tang — 10 papers, h 5
  • Jing Tang — 9 papers, h 3
  • Jing Tang — 9 papers, h 7
  • Jing Tang — 8 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedCampus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene

57 citations · 198 across the 19 of their papers we have counts for

collaborators
Showing 2020Show all

3 papers · 1 filter

cs.CV2020★ 57 cited

Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene

Xinke Li, Chongshou Li, Zekun Tong +5

Learning on 3D scene-based point cloud has received extensive attention as its promising application in many fields, and well-annotated and multisource datasets can catalyze the de…

cs.DS2020★ 17 cited

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

Jing Tang, Xueyan Tang, Andrew Lim +3

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we r…

cs.SI2020★ 3 cited

Efficient Approximation Algorithms for Adaptive Influence Maximization

Keke Huang, Jing Tang, Kai Han +5

Given a social network G and an integer k, the influence maximization (IM) problem asks for a seed set S of k nodes from G to maximize the expected number of nodes influe…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.