default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Lewis Sussman
Person information
- affiliation: National Institutes of Health, Radiology and Imaging Sciences, Clinical Center, Bethesda, MD, USA
- affiliation: Harvard University, Statistics Department, Cambridge, MA, USA
- affiliation (PhD 2014): Johns Hopkins University, Department of Mathematics & Statistics, USA
- affiliation (former): Cornell University, Department of mathematics, Ithaca, NY, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2024
[j11]Zhirui Li
, Ben Johnson, Daniel L. Sussman, Carey E. Priebe, Vince Lyzinski:
Gotta Match 'Em All: Solution Diversification in Graph Matching Matched Filters. IEEE Trans. Signal Inf. Process. over Networks 10: 752-764 (2024)- 2023
- [j10]Christy Lin, Daniel L. Sussman, Prakash Ishwar:
Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings. IEEE Trans. Netw. Sci. Eng. 10(1): 346-359 (2023) - [j9]Wenrui Li, Daniel L. Sussman, Eric D. Kolaczyk:
Estimation of the Branching Factor in Noisy Networks. IEEE Trans. Netw. Sci. Eng. 10(1): 565-577 (2023) - [i7]Zhirui Li, Ben Johnson, Daniel L. Sussman, Carey E. Priebe, Vince Lyzinski:
Gotta match 'em all: Solution diversification in graph matching matched filters. CoRR abs/2308.13451 (2023) - 2022
- [j8]Konstantinos Pantazis, Daniel L. Sussman, Youngser Park, Zhirui Li, Carey E. Priebe, Vince Lyzinski:
Multiplex graph matching matched filters. Appl. Netw. Sci. 7(1): 29 (2022) - 2021
- [j7]Jesús Arroyo, Daniel L. Sussman, Carey E. Priebe, Vince Lyzinski:
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks. J. Comput. Graph. Stat. 30(4): 1111-1123 (2021) - [i6]Christy Lin, Daniel L. Sussman, Prakash Ishwar:
Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings. CoRR abs/2109.04526 (2021) - 2020
- [j6]Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski:
Matched Filters for Noisy Induced Subgraph Detection. IEEE Trans. Pattern Anal. Mach. Intell. 42(11): 2887-2900 (2020)
2010 – 2019
- 2019
- [j5]Runze Tang, Michael D. Ketcha, Alexandra Badea, Evan D. Calabrese, Daniel S. Margulies, Joshua T. Vogelstein, Carey E. Priebe, Daniel L. Sussman:
Connectome Smoothing via Low-Rank Approximations. IEEE Trans. Medical Imaging 38(6): 1446-1456 (2019) - [c5]Lin Li, Daniel L. Sussman:
Graph Matching via Multi-Scale Heat Diffusion. IEEE BigData 2019: 1157-1162 - [c4]Konstantinos Pantazis, Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski:
Multiplex graph matching matched filters. IEEE BigData 2019: 4921-4927 - [i5]Konstantinos Pantazis, Daniel L. Sussman, Youngser Park, Carey E. Priebe, Vince Lyzinski:
Multiplex graph matching matched filters. CoRR abs/1908.02572 (2019) - 2018
- [i4]Daniel L. Sussman, Vince Lyzinski, Youngser Park, Carey E. Priebe:
Matched Filters for Noisy Induced Subgraph Detection. CoRR abs/1803.02423 (2018) - [i3]Jesús Arroyo, Daniel L. Sussman, Carey E. Priebe, Vince Lyzinski:
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks. CoRR abs/1812.10519 (2018) - 2017
- [j4]Avanti Athreya, Donniell E. Fishkind, Minh Tang, Carey E. Priebe, Youngser Park, Joshua T. Vogelstein, Keith D. Levin, Vince Lyzinski, Yichen Qin, Daniel L. Sussman:
Statistical Inference on Random Dot Product Graphs: a Survey. J. Mach. Learn. Res. 18: 226:1-226:92 (2017) - [i2]Vince Lyzinski, Daniel L. Sussman:
Graph matching the matchable nodes when some nodes are unmatchable. CoRR abs/1705.02294 (2017) - 2015
- [j3]Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Li Chen, Joshua T. Vogelstein, Youngser Park, Carey E. Priebe:
Spectral clustering for divide-and-conquer graph matching. Parallel Comput. 47: 70-87 (2015) - 2014
- [j2]Daniel L. Sussman, Minh Tang, Carey E. Priebe:
Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 36(1): 48-57 (2014) - 2013
- [j1]Donniell E. Fishkind, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, Carey E. Priebe:
Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown. SIAM J. Matrix Anal. Appl. 34(1): 23-39 (2013) - [c3]Disa Mhembere, William R. Gray Roncal, Daniel L. Sussman, Carey E. Priebe, Rex E. Jung, Sephira Ryman, R. Jacob Vogelstein, Joshua T. Vogelstein, Randal C. Burns:
Computing scalable multivariate glocal invariants of large (brain-) graphs. GlobalSIP 2013: 297-300 - [i1]Disa Mhembere, William R. Gray Roncal, Daniel L. Sussman, Carey E. Priebe, Rex E. Jung, Sephira Ryman, R. Jacob Vogelstein, Joshua T. Vogelstein, Randal C. Burns:
Computing Scalable Multivariate Glocal Invariants of Large (Brain-) Graphs. CoRR abs/1312.4318 (2013) - 2010
- [c2]Daniel Lewis Sussman, Jianhua Yao, Ronald M. Summers:
Automated measurement and segmentation of abdominal adipose tissue in MRI. ISBI 2010: 936-939 - [c1]Daniel Lewis Sussman, Jianhua Yao, Ronald M. Summers:
Automated fat measurement and segmentation with intensity inhomogeneity correction. Image Processing 2010: 76233X
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-06-03 21:24 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
