4 papers
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach
Mingyang Deng, Xiao Mao, Ziqian Zhong
Unbounded SubsetSum is a classical textbook problem: given integers , we need to find if there exists satisfyin…
Shortest non-separating st-path on chordal graphs
Xiao Mao
Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs. In this paper, we explore…
A natural extension to the convex hull problem and a novel solution
Xiao Mao
We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set in…
Integrating Coarse Granularity Part-level Features with Supervised Global-level Features for Person Re-identification
Xiaofei Mao, Jiahao Cao, Dongfang Li +2
Holistic person re-identification (Re-ID) and partial person re-identification have achieved great progress respectively in recent years. However, scenarios in reality often includ…