ACVNet: Attention Concatenation Volume for Accurate and Efficient Stereo Matching

Kavli Affiliate: Cheng Peng | First 5 Authors: Gangwei Xu, Junda Cheng, Peng Guo, Xin Yang, | Summary: Stereo matching is a fundamental building block for many vision and robotics applications. An informative and concise cost volume representation is vital for stereo matching of high accuracy and efficiency. In this paper, we present a novel […]


Continue.. ACVNet: Attention Concatenation Volume for Accurate and Efficient Stereo Matching

ACVNet: Attention Concatenation Volume for Accurate and Efficient Stereo Matching

Kavli Affiliate: Cheng Peng | First 5 Authors: Gangwei Xu, Junda Cheng, Peng Guo, Xin Yang, | Summary: Stereo matching is a fundamental building block for many vision and robotics applications. An informative and concise cost volume representation is vital for stereo matching of high accuracy and efficiency. In this paper, we present a novel […]


Continue.. ACVNet: Attention Concatenation Volume for Accurate and Efficient Stereo Matching

Attention Concatenation Volume for Accurate and Efficient Stereo Matching

Kavli Affiliate: Cheng Peng | First 5 Authors: Gangwei Xu, Junda Cheng, Peng Guo, Xin Yang, | Summary: Stereo matching is a fundamental building block for many vision and robotics applications. An informative and concise cost volume representation is vital for stereo matching of high accuracy and efficiency. In this paper, we present a novel […]


Continue.. Attention Concatenation Volume for Accurate and Efficient Stereo Matching

CAFE: Learning to Condense Dataset by Aligning Features

Kavli Affiliate: Zheng Zhu | First 5 Authors: Kai Wang, Bo Zhao, Xiangyu Peng, Zheng Zhu, Shuo Yang | Summary: Dataset condensation aims at reducing the network training effort through condensing a cumbersome training set into a compact synthetic one. State-of-the-art approaches largely rely on learning the synthetic data by matching the gradients between the […]


Continue.. CAFE: Learning to Condense Dataset by Aligning Features

Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Kavli Affiliate: Zheng Zhu | First 5 Authors: Mingjie Zhang, Xuan Zhao, Kenji Watanabe, Takashi Taniguchi, Zheng Zhu | Summary: Many sought-after exotic states of matter are known to emerge close to quantum phase transitions, such as quantum spin liquids (QSL) and unconventional superconductivity. It is thus desirable to experimentally explore systems that can be […]


Continue.. Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Kavli Affiliate: Zheng Zhu | First 5 Authors: Mingjie Zhang, Xuan Zhao, Kenji Watanabe, Takashi Taniguchi, Zheng Zhu | Summary: Many sought-after exotic states of matter are known to emerge close to quantum phase transitions, such as quantum spin liquids (QSL) and unconventional superconductivity. It is thus desirable to experimentally explore systems that can be […]


Continue.. Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Symmetric Mass Generation in the 1+1 Dimensional Chiral Fermion 3-4-5-0 Model

Kavli Affiliate: Zheng Zhu | First 5 Authors: Meng Zeng, Zheng Zhu, Juven Wang, Yi-Zhuang You, | Summary: Lattice regularization of chiral fermions has been a long-standing problem in physics. In this work, we present the density matrix renormalization group (DMRG) simulation of the 3-4-5-0 model of (1+1)D chiral fermions with an anomaly-free chiral U(1) […]


Continue.. Symmetric Mass Generation in the 1+1 Dimensional Chiral Fermion 3-4-5-0 Model

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs