Explore the words cloud of the LiftMatch project. It provides you a very rough idea of what is the project "LiftMatch" about.
The following table provides information about the project.
Coordinator |
WEIZMANN INSTITUTE OF SCIENCE
Organization address contact info |
Coordinator Country | Israel [IL] |
Total cost | 1˙675˙640 € |
EC max contribution | 1˙675˙640 € (100%) |
Programme |
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC)) |
Code Call | ERC-2017-COG |
Funding Scheme | ERC-COG |
Starting year | 2018 |
Duration (year-month-day) | from 2018-03-01 to 2023-02-28 |
Take a look of project's partnership.
# | ||||
---|---|---|---|---|
1 | WEIZMANN INSTITUTE OF SCIENCE | IL (REHOVOT) | coordinator | 1˙675˙640.00 |
'This proposal presents a research program aimed at breaking new ground in theoretical, algorithmic and practical aspects of the notoriously difficult matching problems. The main goal is developing a unified algorithmic framework for matching problems that enjoys theoretical guarantees and high practical value for ``real-life' applications.
The core methodological aspect is the modelling of matching problems as high-dimensional, lifted convex problems that can be efficiently approximated. We present several case-studies of this methodology, constructing efficient algorithms for approximating the solutions of important instances of the matching problem. The results already demonstrate state of the art performance and are backed-up with novel theoretical analysis proving tightness and correctness of the suggested convexifications for certain classes of non-trivial input.
This proposal has ``high risk - high impact' profile: The ``high-risk' aspect of this proposal comes from the hardness of general matching problems which, when faithfully represented, are NP-hard. However, as we demonstrate, combining convex optimization tools in a careful way, that takes into account computational complexity, is likely to push forward the limits of current algorithmic solutions. The ``High-impact' will be immediate: As matching problems exist in almost every aspect of scientific research, practical generic algorithms for matching problems are likely to have a significant influence.
We believe that the inroads and preliminary results presented in this proposal already provide strong evidence for the potential success of the suggested research program.'
year | authors and title | journal | last update |
---|---|---|---|
2018 |
Haggai Maron, Yaron Lipman (Probably) concave graph matching published pages: 408--418, ISSN: , DOI: |
Advances in Neural Information Processing Systems | 2019-11-07 |
2018 |
Matan Atzmon, Haggai Maron, Yaron Lipman Point convolutional neural networks by extension operators published pages: 1-12, ISSN: 0730-0301, DOI: 10.1145/3197517.3201301 |
ACM Transactions on Graphics 37/4 | 2019-11-07 |
2019 |
Haggai Maron, Ethan Fetaya, Nimrod Segol, Yaron Lipman On the Universality of Invariant Networks published pages: , ISSN: , DOI: |
International Conference on Machine Learning (ICML) 2019 | 2019-11-07 |
2019 |
Nadav Dym, Raz Slutsky, Yaron Lipman Linear variational principle for Riemann mappings and discrete conformality published pages: 732-737, ISSN: 0027-8424, DOI: 10.1073/pnas.1809731116 |
Proceedings of the National Academy of Sciences 116/3 | 2019-11-07 |
2019 |
Niv Haim*, Nimrod Segol*, Heli Ben-Hamu, Haggai Maron, Yaron Lipman Surface Networks via General Covers published pages: , ISSN: , DOI: |
International Conference on Computer Vision (ICCV) 2019 | 2019-11-07 |
2019 |
Heli Ben-Hamu, Haggai Maron, Itay Kezurer, Gal Avineri, Yaron Lipman Multi-chart generative surface modeling published pages: 1-15, ISSN: 0730-0301, DOI: 10.1145/3272127.3275052 |
ACM Transactions on Graphics 37/6 | 2019-11-07 |
2018 |
Roee Lazar, Nadav Dym, Yam Kushinsky, Zhiyang Huang, Tao Ju, Yaron Lipman Robust optimization for topological surface reconstruction published pages: 1-10, ISSN: 0730-0301, DOI: 10.1145/3197517.3201348 |
ACM Transactions on Graphics 37/4 | 2019-11-07 |
2019 |
Haggai Maron and
Heli Ben{-}Hamu and
Nadav Shamir and
Yaron Lipman Invariant and Equivariant Graph Networks published pages: , ISSN: , DOI: |
7th International Conference on Learning Representations, {ICLR} 2019, New Orleans, LA, USA, May 6-9, 2019 | 2019-11-07 |
2019 |
Yam Kushinsky, Haggai Maron, Nadav Dym, Yaron Lipman Sinkhorn Algorithm for Lifted Assignment Problems published pages: 716-735, ISSN: 1936-4954, DOI: 10.1137/18m1196480 |
SIAM Journal on Imaging Sciences 12/2 | 2019-11-07 |
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "LIFTMATCH" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "LIFTMATCH" are provided by the European Opendata Portal: CORDIS opendata.