default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDejan Slepcev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Jeff Calder
, Sangmin Park, Dejan Slepcev:
Boundary Estimation from Point Clouds: Algorithms, Guarantees and Applications. J. Sci. Comput. 92(2): 56 (2022)- [c5]Lantian Xu, Anna Korba, Dejan Slepcev:
Accurate Quantization of Measures via Interacting Particle-based Optimization. ICML 2022: 24576-24595 - 2021
- [i13]Katy Craig, Nicolás García Trillos, Dejan Slepcev:
Clustering dynamics on graphs: from spectral clustering to mean shift through Fokker-Planck interpolation. CoRR abs/2108.08687 (2021) - [i12]Jeff Calder, Sangmin Park, Dejan Slepcev:
Boundary Estimation from Point Clouds: Algorithms, Guarantees and Applications. CoRR abs/2111.03217 (2021) - 2020
- [j13]Nicolás García Trillos, Moritz Gerlach, Matthias Hein, Dejan Slepcev:
Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace-Beltrami Operator. Found. Comput. Math. 20(4): 827-887 (2020) - [c4]Jeff Calder, Brendan Cook, Matthew Thorpe, Dejan Slepcev:
Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates. ICML 2020: 1306-1316 - [i11]Jeff Calder, Dejan Slepcev, Matthew Thorpe:
Rates of Convergence for Laplacian Semi-Supervised Learning with Low Labeling Rates. CoRR abs/2006.02765 (2020) - [i10]Jeff Calder, Brendan Cook, Matthew Thorpe, Dejan Slepcev:
Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates. CoRR abs/2006.11184 (2020)
2010 – 2019
- 2019
- [j12]Dejan Slepcev, Matthew Thorpe:
Analysis of p-Laplacian Regularization in Semisupervised Learning. SIAM J. Math. Anal. 51(3): 2085-2120 (2019) - [i9]Antonio Esposito, Francesco S. Patacchini, André Schlichting, Dejan Slepcev:
Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit. CoRR abs/1912.09834 (2019) - 2018
- [j11]Yousuf Soliman, Dejan Slepcev, Keenan Crane:
Optimal cone singularities for conformal flattening. ACM Trans. Graph. 37(4): 105 (2018) - [i8]Matthew M. Dunlop, Dejan Slepcev, Andrew M. Stuart, Matthew Thorpe:
Large Data and Zero Noise Limits of Graph-Based Semi-Supervised Learning Algorithms. CoRR abs/1805.09450 (2018) - [i7]Jeff Calder, Dejan Slepcev:
Properly-weighted graph Laplacian for semi-supervised learning. CoRR abs/1810.04351 (2018) - 2017
- [j10]Matthew Thorpe, Serim Park, Soheil Kolouri, Gustavo K. Rohde, Dejan Slepcev:
A Transportation Lp Distance for Signal Analysis. J. Math. Imaging Vis. 59(2): 187-210 (2017) - [j9]Slav Kirov, Dejan Slepcev:
Multiple Penalized Principal Curves: Analysis and Computation. J. Math. Imaging Vis. 59(2): 234-256 (2017) - [j8]Soheil Kolouri, Se Rim Park, Matthew Thorpe, Dejan Slepcev, Gustavo K. Rohde:
Optimal Mass Transport: Signal processing and machine-learning applications. IEEE Signal Process. Mag. 34(4): 43-59 (2017) - [i6]Dejan Slepcev, Matthew Thorpe:
Analysis of $p$-Laplacian Regularization in Semi-Supervised Learning. CoRR abs/1707.06213 (2017) - 2016
- [j7]Nicolás García Trillos, Dejan Slepcev, James H. von Brecht, Thomas Laurent, Xavier Bresson:
Consistency of Cheeger and Ratio Graph Cuts. J. Mach. Learn. Res. 17: 181:1-181:46 (2016) - [i5]Soheil Kolouri, Serim Park, Matthew Thorpe, Dejan Slepcev, Gustavo K. Rohde:
Transport-based analysis, modeling, and learning from signal and data distributions. CoRR abs/1609.04767 (2016) - [i4]Matthew Thorpe, Serim Park, Soheil Kolouri, Gustavo K. Rohde, Dejan Slepcev:
A Transportation Lp Distance for Signal Analysis. CoRR abs/1609.08669 (2016) - 2015
- [j6]Matt Elsey, Dejan Slepcev:
Mean-Curvature Flow of Voronoi Diagrams. J. Nonlinear Sci. 25(1): 59-85 (2015) - [c3]Soheil Kolouri, Dejan Slepcev, Gustavo K. Rohde:
A symmetric deformation-based similarity measure for shape analysis. ISBI 2015: 314-318 - [i3]Nicolás García Trillos, Dejan Slepcev:
A variational approach to the consistency of spectral clustering. CoRR abs/1508.01928 (2015) - [i2]Slav Kirov, Dejan Slepcev:
Multiple penalized principal curves: analysis and computation. CoRR abs/1512.05010 (2015) - 2014
- [i1]Nicolás García Trillos, Dejan Slepcev, James H. von Brecht, Thomas Laurent, Xavier Bresson:
Consistency of Cheeger and Ratio Graph Cuts. CoRR abs/1411.6590 (2014) - 2013
- [j5]Wei Wang, Dejan Slepcev, Saurav Basu, John A. Ozolek, Gustavo K. Rohde:
A Linear Optimal Transportation Framework for Quantifying and Visualizing Variations in Sets of Images. Int. J. Comput. Vis. 101(2): 254-269 (2013) - [j4]Xin Yang Lu, Dejan Slepcev:
Properties of Minimizers of Average-Distance Problem via Discrete Approximation of Measures. SIAM J. Math. Anal. 45(5): 3114-3131 (2013) - 2012
- [c2]Gustavo K. Rohde, Wei Wang, Saurav Basu, Dejan Slepcev:
A linear transport-based embedding method for analyzing biomedical images. ACSCC 2012: 1593-1596 - 2011
- [j3]Wei Wang, John A. Ozolek, Dejan Slepcev, Ann B. Lee, Cheng Chen, Gustavo K. Rohde:
An Optimal Transportation Approach for Nuclear Structure-Based Pathology. IEEE Trans. Medical Imaging 30(3): 621-631 (2011) - 2010
- [c1]Wei Wang, Cheng Chen, Tao Peng, Dejan Slepcev, John A. Ozolek, Gustavo K. Rohde:
A graph-based method for detecting characteristic phenotypes from biomedical images. ISBI 2010: 129-132
2000 – 2009
- 2008
- [j2]Dejan Slepcev:
Coarsening in Nonlocal Interfacial Systems. SIAM J. Math. Anal. 40(3): 1029-1048 (2008) - 2006
- [j1]Felix Otto, Tobias Rump, Dejan Slepcev:
Coarsening Rates for a Droplet Model: Rigorous Upper Bounds. SIAM J. Math. Anal. 38(2): 503-529 (2006)
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-21 00:07 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:
