research
∙
07/26/2023
Unveiling Security, Privacy, and Ethical Concerns of ChatGPT
This paper delves into the realm of ChatGPT, an AI-powered chatbot that ...
share
research
∙
07/09/2023
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
In undirected graphs with real non-negative weights, we give a new rando...
research
∙
11/26/2022
Robust One-shot Segmentation of Brain Tissues via Image-aligned Style Transformation
One-shot segmentation of brain tissues is typically a dual-model iterati...
research
∙
10/18/2022
Faster Matrix Multiplication via Asymmetric Hashing
Fast matrix multiplication is one of the most fundamental problems in al...
research
∙
04/09/2022
Faster Min-Plus Product for Monotone Instances
In this paper, we show that the time complexity of monotone min-plus pro...
research
∙
11/05/2021
Maintaining Exact Distances under Multiple Edge Failures
We present the first compact distance oracle that tolerates multiple fai...
research
∙
10/17/2021
Faster Algorithms for Bounded-Difference Min-Plus Product
Min-plus product of two n× n matrices is a fundamental problem in algori...
research
∙
05/16/2021
Near-Optimal Time-Energy Trade-Offs for Deterministic Leader Election
We consider the energy complexity of the leader election problem in the ...
research
∙
03/17/2020
A Scaling Algorithm for Weighted f-Factors in General Graphs
We study the maximum weight perfect f-factor problem on any general simp...
research
∙
02/17/2020
Approximate Distance Oracles Subject to Multiple Vertex Failures
Given an undirected graph G=(V,E) of n vertices and m edges with weights...
research
∙
11/27/2019
Roundtrip Spanners with (2k-1) Stretch
A roundtrip spanner of a directed graph G is a subgraph of G preserving ...
research
∙
08/10/2019
Boundary Effect-Aware Visual Tracking for UAV with Online Enhanced Background Learning and Multi-Frame Consensus Verification
Due to implicitly introduced periodic shifting of limited searching area...
research
∙
04/24/2019
Faster Algorithms for All Pairs Non-decreasing Paths Problem
In this paper, we present an improved algorithm for the All Pairs Non-de...
research
∙
08/31/2018
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
In a directed graph G=(V,E) with a capacity on every edge, a bottleneck ...
research
∙
12/26/2017
