


Остановите войну!
for scientists:


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2023
- Ingrid Daubechies, Ronald A. DeVore, Nadav Dym, Shira Faigenbaum-Golovin, Shahar Z. Kovalsky, Kung-Ching Lin, Josiah Park, Guergana Petrova, Barak Sober
:
Neural Network Approximation of Refinable Functions. IEEE Trans. Inf. Theory 69(1): 482-495 (2023) - Snir Hordan, Tal Amir, Steven J. Gortler, Nadav Dym:
Complete Neural Networks for Euclidean Graphs. CoRR abs/2301.13821 (2023) - Tal Amir, Steven J. Gortler, Ilai Avni, Ravina Ravina, Nadav Dym:
Neural Injective Functions for Multisets, Measures and Graphs via a Finite Witness Theorem. CoRR abs/2306.06529 (2023) - 2022
- Ben Finkelshtein, Chaim Baskin, Haggai Maron, Nadav Dym:
A Simple and Universal Rotation Equivariant Point-Cloud Network. TAG-ML 2022: 107-115 - Ben Finkelshtein, Chaim Baskin, Haggai Maron, Nadav Dym:
A Simple and Universal Rotation Equivariant Point-cloud Network. CoRR abs/2203.01216 (2022) - Nadav Dym, Steven J. Gortler:
Low Dimensional Invariant Embeddings for Universal Geometric Learning. CoRR abs/2205.02956 (2022) - Tal Amir, Shahar Z. Kovalsky, Nadav Dym:
Symmetrized Robust Procrustes: Constant-Factor Approximation and Exact Recovery. CoRR abs/2207.08592 (2022) - 2021
- Nadav Dym, Haggai Maron:
On the Universality of Rotation Equivariant Point Cloud Networks. ICLR 2021 - Ingrid Daubechies, Ronald A. DeVore, Nadav Dym, Shira Faigenbaum-Golovin, Shahar Z. Kovalsky
, Kung-Ching Lin, Josiah Park
, Guergana Petrova, Barak Sober:
Neural Network Approximation of Refinable Functions. CoRR abs/2107.13191 (2021) - 2020
- Nadav Dym, Barak Sober
, Ingrid Daubechies:
Expression of Fractals Through Neural Network Functions. IEEE J. Sel. Areas Inf. Theory 1(1): 57-66 (2020) - Cheng Cheng, Ingrid Daubechies, Nadav Dym, Jianfeng Lu:
Stable Phase Retrieval from Locally Stable and Conditionally Connected Measurements. CoRR abs/2006.11709 (2020) - Nadav Dym, Haggai Maron:
On the Universality of Rotation Equivariant Point Cloud Networks. CoRR abs/2010.02449 (2020) - 2019
- Yam Kushinsky, Haggai Maron, Nadav Dym, Yaron Lipman:
Sinkhorn Algorithm for Lifted Assignment Problems. SIAM J. Imaging Sci. 12(2): 716-735 (2019) - Nadav Dym, Shahar Z. Kovalsky:
Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration. ICCV 2019: 1628-1636 - Nadav Dym, Shahar Ziv Kovalsky:
Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration. CoRR abs/1904.02204 (2019) - Nadav Dym, Barak Sober, Ingrid Daubechies:
Expression of Fractals Through Neural Network Functions. CoRR abs/1905.11345 (2019) - 2018
- Nadav Dym:
Exact Recovery with Symmetries for the Doubly Stochastic Relaxation. SIAM J. Appl. Algebra Geom. 2(3): 462-488 (2018) - Roee Lazar, Nadav Dym, Yam Kushinsky, Zhiyang Huang, Tao Ju, Yaron Lipman:
Robust optimization for topological surface reconstruction. ACM Trans. Graph. 37(4): 46 (2018) - 2017
- Nadav Dym, Yaron Lipman:
Exact Recovery with Symmetries for Procrustes Matching. SIAM J. Optim. 27(3): 1513-1530 (2017) - Nadav Dym, Haggai Maron, Yaron Lipman:
DS++: a flexible, scalable and provably tight relaxation for matching problems. ACM Trans. Graph. 36(6): 184:1-184:14 (2017) - Haggai Maron, Meirav Galun, Noam Aigerman, Miri Trope, Nadav Dym, Ersin Yumer, Vladimir G. Kim, Yaron Lipman:
Convolutional neural networks on surfaces via seamless toric covers. ACM Trans. Graph. 36(4): 71:1-71:10 (2017) - Nadav Dym, Haggai Maron, Yaron Lipman:
DS++: A flexible, scalable and provably tight relaxation for matching problems. CoRR abs/1705.06148 (2017) - Nadav Dym, Yaron Lipman, Raz Slutsky:
A Linear Variational Principle for Riemann Mapping and Discrete Conformality. CoRR abs/1711.02221 (2017) - 2016
- Haggai Maron, Nadav Dym, Itay Kezurer, Shahar Z. Kovalsky, Yaron Lipman:
Point registration via efficient convex relaxation. ACM Trans. Graph. 35(4): 73:1-73:12 (2016) - 2015
- Nadav Dym, Anna Shtengel, Yaron Lipman:
Homotopic Morphing of Planar Curves. Comput. Graph. Forum 34(5): 239-251 (2015)
loading more results
failed to load more results, please try again later

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2023-09-30 07:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint