85 citations · 102 across the 9 of their papers we have counts for
9 papers
Window Normalization: Enhancing Point Cloud Understanding by Unifying Inconsistent Point Densities
Qi Wang, Sheng Shi, Jiahui Li +2
Downsampling and feature extraction are essential procedures for 3D point cloud understanding. Existing methods are limited by the inconsistent point densities of different parts i…
Single Image Super-Resolution via a Holistic Attention Network
Ben Niu, Weilei Wen, Wenqi Ren +6
Informative features play a crucial role in the single image super-resolution task. Channel attention has been demonstrated to be effective for preserving information-rich features…
Hallucinating very low-resolution and obscured face images
Lianping Yang, Bin Shao, Ting Sun +2
Most of the face hallucination methods are designed for complete inputs. They will not work well if the inputs are very tiny or contaminated by large occlusion. Inspired by this fa…
On hypergraph Lagrangians
Qingsong Tang, Xiaojun Lu, Xiangde Zhang +1
It is conjectured by Frankl and Füredi that the -uniform hypergraph with edges formed by taking the first sets in the colex ordering of has the large…
Connection between the clique number and the Lagrangian of -uniform hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
There is a remarkable connection between the clique number and the Lagrangian of a 2-graph proved by Motzkin and Straus in 1965. It is useful in practice if similar results hold fo…
On hypergraph cliques and polynomial programming
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadra…
On Lagrangians of Hypergraphs Containing Dense Subgraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employ…
On the largest graph-Lagrangians of hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
Frankl and Füredi (1989) conjectured that the -graph with edges formed by taking the first sets in the colex ordering of has the largest graph-Lagran…
Some Results on Lagrangians of Hypergraphs
Qingsong Tang, Yuejian Peng, Xiangde Zhang +1
In 1965, Motzkin and Straus [5] provided a new proof of Turan's theorem based on a continuous characterization of the clique number of a graph using the Lagrangian of a graph. This…