Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMargaret H. Regan
Person information
- affiliation: Duke University, Department of Mathematics, Durham, USA
- affiliation: College of the Holy Cross, Worcester, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Edgar A. Bernal, Jonathan D. Hauenstein, Dhagash Mehta, Margaret H. Regan
, Tingting Tang:
Machine learning the real discriminant locus. J. Symb. Comput. 115: 409-426 (2023)- [j4]Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles W. Wampler, Jonathan D. Hauenstein, Peter J. Giblin, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla:
Trifocal Relative Pose From Lines at Points. IEEE Trans. Pattern Anal. Mach. Intell. 45(6): 7870-7884 (2023) - [c4]Timothy Duff, Viktor Korotynskiy, Tomás Pajdla, Margaret H. Regan:
Using monodromy to recover symmetries of polynomial systems. ISSAC 2023: 251-259 - [i5]Wenrui Hao, Jonathan D. Hauenstein, Margaret H. Regan, Tingting Tang:
A numerical method for solving elliptic equations on real closed algebraic curves and surfaces. CoRR abs/2311.09866 (2023) - [i4]Timothy Duff, Viktor Korotynskiy, Tomás Pajdla, Margaret H. Regan:
Using monodromy to recover symmetries of polynomial systems. CoRR abs/2312.12685 (2023) - 2022
- [j3]Timothy Duff, Viktor Korotynskiy, Tomás Pajdla, Margaret H. Regan:
Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction. SIAM J. Appl. Algebra Geom. 6(1): 740-772 (2022) - 2021
- [i3]Timothy Duff, Viktor Korotynskiy, Tomás Pajdla, Margaret H. Regan:
Galois/monodromy groups for decomposing minimal problems in 3D reconstruction. CoRR abs/2105.04460 (2021) - 2020
- [j2]Jonathan D. Hauenstein, Margaret H. Regan:
Real monodromy action. Appl. Math. Comput. 373: 124983 (2020) - [c3]Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles W. Wampler, Jonathan D. Hauenstein, Peter J. Giblin, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla:
TRPLP - Trifocal Relative Pose From Lines at Points. CVPR 2020: 12070-12080 - [c2]Jonathan D. Hauenstein, Margaret H. Regan:
Evaluating and Differentiating a Polynomial Using a Pseudo-witness Set. ICMS 2020: 61-69 - [i2]Edgar A. Bernal, Jonathan D. Hauenstein, Dhagash Mehta, Margaret H. Regan, Tingting Tang:
Machine learning the real discriminant locus. CoRR abs/2006.14078 (2020)
2010 – 2019
- 2019
- [i1]Ricardo Fabbri, Timothy Duff, Hongyi Fan, Margaret H. Regan, David da Costa de Pinho, Elias P. Tsigaridas, Charles Wrampler, Jonathan D. Hauenstein, Benjamin B. Kimia, Anton Leykin, Tomás Pajdla:
Trifocal Relative Pose from Lines at Points and its Efficient Solution. CoRR abs/1903.09755 (2019) - 2018
- [j1]Jonathan D. Hauenstein, Margaret H. Regan:
Adaptive strategies for solving parameterized systems using homotopy continuation. Appl. Math. Comput. 332: 19-34 (2018) - [c1]Danielle A. Brake, Jonathan D. Hauenstein, Margaret H. Regan:
polyTop: Software for Computing Topology of Smooth Real Surfaces. ICMS 2018: 397-404
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 2024-04-25 01:34 CEST 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:
