default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVeit Elser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i12]Sean Deyo, Veit Elser:
A transparent approach to data representation. CoRR abs/2304.14209 (2023)- [i11]Sean Deyo, Veit Elser:
A logical word embedding for learning grammar. CoRR abs/2304.14590 (2023) - 2022
- [i10]Sean Deyo, Veit Elser:
Learning grammar with a divide-and-concur neural network. CoRR abs/2201.07341 (2022) - 2021
- [i9]Sean Deyo, Veit Elser:
Avoiding Traps in Nonconvex Problems. CoRR abs/2106.05206 (2021) - 2020
- [j11]Francisco J. Aragón Artacho
, Rubén Campoy, Veit Elser:
An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm. J. Glob. Optim. 77(2): 383-403 (2020) - [i8]Veit Elser:
Reconstructing cellular automata rules from observations at nonconsecutive times. CoRR abs/2012.02179 (2020)
2010 – 2019
- 2019
- [j10]Veit Elser, Dan Schmidt, Jonathan S. Yedidia:
Monotone Learning with Rectified Wire Networks. J. Mach. Learn. Res. 20: 27:1-27:42 (2019) - [i7]Veit Elser:
Learning Without Loss. CoRR abs/1911.00493 (2019) - 2018
- [j9]Veit Elser, Ti-Yen Lan, Tamir Bendory:
Benchmark Problems for Phase Retrieval. SIAM J. Imaging Sci. 11(4): 2429-2455 (2018) - [j8]Veit Elser:
The Complexity of Bit Retrieval. IEEE Trans. Inf. Theory 64(1): 412-428 (2018) - [i6]Veit Elser, Dan Schmidt, Jonathan S. Yedidia:
Monotone Learning with Rectifier Networks. CoRR abs/1805.03963 (2018) - 2017
- [j7]Veit Elser:
Matrix product constraints by projection methods. J. Glob. Optim. 68(2): 329-355 (2017) - [i5]Veit Elser, Ti-Yen Lan:
Benchmark problems for phase retrieval. CoRR abs/1706.00399 (2017) - 2016
- [j6]Veit Elser:
A Network That Learns Strassen Multiplication. J. Mach. Learn. Res. 17: 116:1-116:13 (2016) - [i4]Veit Elser:
The complexity of bit retrieval. CoRR abs/1601.03428 (2016) - [i3]Veit Elser:
A network that learns Strassen multiplication. CoRR abs/1601.07227 (2016) - 2013
- [i2]Nate Derbinsky, José Bento, Veit Elser, Jonathan S. Yedidia:
An Improved Three-Weight Message-Passing Algorithm. CoRR abs/1305.1961 (2013) - 2011
- [j5]Simon Gravel, Veit Elser, Yoav Kallus:
Upper Bound on the Packing Density of Regular Tetrahedra and Octahedra. Discret. Comput. Geom. 46(4): 799-818 (2011) - [e1]Heinz H. Bauschke, Regina Sandra Burachik, Patrick L. Combettes, Veit Elser, D. Russell Luke, Henry Wolkowicz:
Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications 49, Springer 2011, ISBN 978-1-4419-9568-1 [contents] - 2010
- [j4]Veit Elser, Simon Gravel:
Laminating Lattices with Symmetrical Glue. Discret. Comput. Geom. 43(2): 363-374 (2010) - [j3]Yoav Kallus, Veit Elser, Simon Gravel:
Dense Periodic Packings of Tetrahedra with Small Repeating Units. Discret. Comput. Geom. 44(2): 245-252 (2010) - [i1]Veit Elser, Stefan Eisebitt:
Uniqueness transition in noisy phase retrieval. CoRR abs/1009.4693 (2010)
2000 – 2009
- 2009
- [j2]Veit Elser:
Noise limits on reconstructing diffraction signals from random tomographs. IEEE Trans. Inf. Theory 55(10): 4715-4722 (2009) - 2001
- [j1]Veit Elser:
Crystallography and Riemann Surfaces. Discret. Comput. Geom. 25(3): 445-476 (2001)
Coauthor Index
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.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
