research
∙
09/06/2023
On the Line-Separable Unit-Disk Coverage and Related Problems
Given a set P of n points and a set S of m disks in the plane, the disk ...
share
research
∙
08/14/2023
AudioFormer: Audio Transformer learns audio feature representations from discrete acoustic codes
We propose a method named AudioFormer,which learns audio feature represe...
research
∙
06/01/2023
Improved Algorithms for Distance Selection and Related Problems
In this paper, we propose new techniques for solving geometric optimizat...
research
∙
05/31/2023
MSMix:An Interpolation-Based Text Data Augmentation Method Manifold Swap Mixup
To solve the problem of poor performance of deep neural network models d...
research
∙
05/15/2023
Geometric Hitting Set for Line-Constrained Disks and Related Problems
Given a set P of n weighted points and a set S of m disks in the plane, ...
research
∙
05/14/2023
Dynamic Convex Hulls under Window-Sliding Updates
We consider the problem of dynamically maintaining the convex hull of a ...
research
∙
12/19/2022
Statistical Dataset Evaluation: Reliability, Difficulty, and Validity
Datasets serve as crucial training resources and model performance track...
research
∙
06/24/2022
Computing the Minimum Bottleneck Moving Spanning Tree
Given a set P of n points that are moving in the plane, we consider the ...
research
∙
06/07/2022
Learning Symbolic Operators: A Neurosymbolic Solution for Autonomous Disassembly of Electric Vehicle Battery
The booming of electric vehicles demands efficient battery disassembly f...
research
∙
05/16/2022
Autonomous Electric Vehicle Battery Disassembly Based on NeuroSymbolic Computing
The booming of electric vehicles demands efficient battery disassembly f...
research
∙
04/19/2022
Unit-Disk Range Searching and Applications
Given a set P of n points in the plane, we consider the problem of compu...
research
∙
11/16/2021
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines
Let L be a set of n lines in the plane. The zone Z(â„“) of a line â„“ in the...
research
∙
10/16/2021
Constructing Many Faces in Arrangements of Lines and Segments
We present new algorithms for computing many faces in arrangements of li...
research
∙
08/28/2021
AMMASurv: Asymmetrical Multi-Modal Attention for Accurate Survival Analysis with Whole Slide Images and Gene Expression Data
The use of multi-modal data such as the combination of whole slide image...
research
∙
04/29/2021
Algorithms for the Line-Constrained Disk Coverage and Related Problems
Given a set P of n points and a set S of m weighted disks in the plane, ...
research
∙
04/29/2021
Reverse Shortest Path Problem for Unit-Disk Graphs
Given a set P of n points in the plane, a unit-disk graph G_r(P) with re...
research
∙
02/26/2021
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
Given a set S of m point sites in a simple polygon P of n vertices, we c...
research
∙
02/24/2021
A New Algorithm for Euclidean Shortest Paths in the Plane
Given a set of pairwise disjoint polygonal obstacles in the plane, findi...
research
∙
11/19/2020
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
We consider the problem of computing the diameter of a unicycle graph (i...
research
∙
10/30/2020
Towards Accurate and Consistent Evaluation: A Dataset for Distantly-Supervised Relation Extraction
In recent years, distantly-supervised relation extraction has achieved a...
research
∙
10/18/2020
Shortest Paths Among Obstacles in the Plane Revisited
Given a set of pairwise disjoint polygonal obstacles in the plane, findi...
research
∙
06/24/2020
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Let P be a path graph of n vertices embedded in a metric space. We consi...
research
∙
03/09/2020
Overview of the CCKS 2019 Knowledge Graph Evaluation Track: Entity, Relation, Event and QA
Knowledge graph models world knowledge as concepts, entities, and the re...
research
∙
02/25/2020
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments
In this paper, we first consider the subpath convex hull query problem: ...
research
∙
02/19/2020
On the Planar Two-Center Problem and Circular Hulls
Given a set S of n points in the Euclidean plane, the two-center problem...
research
∙
08/29/2019
CCKS 2019 Shared Task on Inter-Personal Relationship Extraction
The CCKS2019 shared task was devoted to inter-personal relationship extr...
research
∙
07/30/2019
IPRE: a Dataset for Inter-Personal Relationship Extraction
Inter-personal relationship is the basis of human society. In order to a...
research
∙
05/01/2019
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points
We consider a bichromatic two-center problem for pairs of points. Given ...
research
∙
04/26/2019
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Let P be a path graph of n vertices embedded in a metric space. We consi...
research
∙
03/12/2019
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
We revisit a classical graph-theoretic problem, the single-source shorte...
research
∙
03/04/2019
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains
Let P be a polygonal domain of h holes and n vertices. We study the prob...
research
∙
09/20/2018
