ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.06148
  4. Cited By
DS++: A flexible, scalable and provably tight relaxation for matching
  problems

DS++: A flexible, scalable and provably tight relaxation for matching problems

17 May 2017
Nadav Dym
Haggai Maron
Y. Lipman
ArXivPDFHTML

Papers citing "DS++: A flexible, scalable and provably tight relaxation for matching problems"

1 / 1 papers shown
Title
A Robust Loss for Point Cloud Registration
A Robust Loss for Point Cloud Registration
Z. Deng
Yuxin Yao
Bailin Deng
Juyong Zhang
3DPC
19
19
0
26 Aug 2021
1