Dejan Slepčev - Citegraph

Author Info

Name	Affiliation	Papers
DEJAN SLEPČEV	Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA	20
Collaborators	Citations	PageRank
33	95	11.01
Referers	Referees	References
201	443	224

Search Limit

100443

Publications (20 rows)

Collaborators (33 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Boundary Estimation from Point Clouds: Algorithms, Guarantees and Applications	0	0.34	2022
Poisson Learning: Graph Based Semi-Supervised Learning At Very Low Label Rates	0	0.34	2020
Analysis of p-Laplacian Regularization in Semisupervised Learning.	0	0.34	2019
Properly-Weighted Graph Laplacian For Semi-Supervised Learning	1	0.38	2018
Large Data and Zero Noise Limits of Graph-Based Semi-Supervised Learning Algorithms.	1	0.38	2018
Optimal cone singularities for conformal flattening.	2	0.36	2018
Analysis of $p$-Laplacian Regularization in Semi-Supervised Learning.	6	0.57	2017
Optimal Mass Transport: Signal processing and machine-learning applications.	18	0.81	2017
A Transportation Lp Distance for Signal Analysis.	0	0.34	2017
Transport-based analysis, modeling, and learning from signal and data distributions.	2	0.40	2016
Mean-Curvature Flow of Voronoi Diagrams.	0	0.34	2015
Multiple penalized principal curves: analysis and computation	0	0.34	2015
A symmetric deformation-based similarity measure for shape analysis	0	0.34	2015
Consistency of Cheeger and Ratio Graph Cuts.	6	0.45	2014
A linear optimal transportation framework for quantifying and visualizing variations in sets of images.	30	1.40	2013
Properties of Minimizers of Average-Distance Problem via Discrete Approximation of Measures.	7	0.58	2013
An optimal transportation approach for nuclear structure-based pathology.	10	0.83	2011
A graph-based method for detecting characteristic phenotypes from biomedical images	1	0.42	2010
Coarsening in Nonlocal Interfacial Systems	4	0.67	2008
Coarsening Rates for a Droplet Model: Rigorous Upper Bounds	7	1.40	2006