![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Raif M. Rustamov
Person information
- affiliation: Stanford University, Computer Science Department
- affiliation: Drew University, Department of Mathematics and Computer Science
- affiliation: Purdue University, Department of Mathematics
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c16]Raif M. Rustamov, Subhabrata Majumdar:
Intrinsic Sliced Wasserstein Distances for Comparing Collections of Probability Distributions on Manifolds and Graphs. ICML 2023: 29388-29415 - 2020
- [c15]Shuai Zhao, Wen-Ling Hsu, George Ma, Tan Xu, Guy Jacobson, Raif M. Rustamov:
Characterizing and Learning Representation on Customer Contact Journeys in Cellular Services. KDD 2020: 3252-3260 - [c14]Shuai Zhao, Xiaopeng Jiang, Guy Jacobson, Rittwik Jana, Wen-Ling Hsu, Raif M. Rustamov, Manoop Talasila, Syed Anwar Aftab, Yi Chen, Cristian Borcea:
Cellular Network Traffic Prediction Incorporating Handover: A Graph Convolutional Approach. SECON 2020: 1-9
2010 – 2019
- 2019
- [i5]Raif M. Rustamov:
Closed-form Expressions for Maximum Mean Discrepancy with Applications to Wasserstein Auto-Encoders. CoRR abs/1901.03227 (2019) - 2018
- [c13]Raif M. Rustamov, James T. Klosowski:
Interpretable Graph-Based Semi-Supervised Learning via Flows. AAAI 2018: 3976-3983 - [i4]Nan Hu, Raif M. Rustamov, Leonidas J. Guibas:
Graph Matching with Anchor Nodes: A Learning Approach. CoRR abs/1804.03715 (2018) - 2017
- [c12]Tong Wu, Raif M. Rustamov, Colin Goodall:
Distributed learning of human mobility patterns from cellular network data. CISS 2017: 1-6 - [i3]Raif M. Rustamov, James T. Klosowski:
Interpretable Graph-Based Semi-Supervised Learning via Flows. CoRR abs/1709.04764 (2017) - 2016
- [i2]Justin Solomon, Raif M. Rustamov, Leonidas J. Guibas, Adrian Butscher:
Continuous-Flow Graph Transportation Distances. CoRR abs/1603.06927 (2016) - 2014
- [j9]Justin Solomon, Raif M. Rustamov, Leonidas J. Guibas, Adrian Butscher:
Earth mover's distances on discrete surfaces. ACM Trans. Graph. 33(4): 67:1-67:12 (2014) - [c11]Nan Hu, Raif M. Rustamov, Leonidas J. Guibas:
Stable and Informative Spectral Signatures for Graph Matching. CVPR 2014: 2313-2320 - [c10]Justin Solomon, Raif M. Rustamov, Leonidas J. Guibas, Adrian Butscher:
Wasserstein Propagation for Semi-Supervised Learning. ICML 2014: 306-314 - [c9]Raif M. Rustamov, David Romano, Allan L. Reiss, Leonidas J. Guibas:
Compact and Informative Representation of Functional Connectivity for Predictive Modeling. MICCAI (3) 2014: 153-160 - [c8]Raif M. Rustamov, Leonidas J. Guibas:
Hyperalignment of Multi-subject fMRI Data by Synchronized Projections. MLINI@NIPS 2014: 115-121 - 2013
- [j8]Raif M. Rustamov, Maks Ovsjanikov, Omri Azencot, Mirela Ben-Chen, Frédéric Chazal, Leonidas J. Guibas:
Map-based exploration of intrinsic shape differences and variability. ACM Trans. Graph. 32(4): 72:1-72:12 (2013) - [c7]Nan Hu, Raif M. Rustamov, Leonidas J. Guibas:
Graph Matching with Anchor Nodes: A Learning Approach. CVPR 2013: 2906-2913 - [c6]Raif M. Rustamov, Leonidas J. Guibas:
Wavelets on Graphs via Deep Learning. NIPS 2013: 998-1006 - 2011
- [j7]Raif M. Rustamov:
Multiscale Biharmonic Kernels. Comput. Graph. Forum 30(5): 1521-1531 (2011) - [j6]Raif M. Rustamov:
Interpolated eigenfunctions for volumetric shape processing. Vis. Comput. 27(11): 951-961 (2011) - [i1]Raif M. Rustamov:
Average Interpolating Wavelets on Point Clouds and Graphs. CoRR abs/1110.2227 (2011) - 2010
- [j5]Raif M. Rustamov:
Barycentric Coordinates on Surfaces. Comput. Graph. Forum 29(5): 1507-1516 (2010) - [j4]Yaron Lipman, Raif M. Rustamov, Thomas A. Funkhouser:
Biharmonic distance. ACM Trans. Graph. 29(3): 27:1-27:11 (2010) - [j3]Raif M. Rustamov:
A versatile framework for shape description. Vis. Comput. 26(10): 1245-1256 (2010) - [c5]Raif M. Rustamov:
Robust Volumetric Shape Descriptor. 3DOR@Eurographics 2010: 1-5
2000 – 2009
- 2009
- [j2]Raif M. Rustamov, Yaron Lipman, Thomas A. Funkhouser:
Interior Distance Using Barycentric Coordinates. Comput. Graph. Forum 28(5): 1279-1288 (2009) - [c4]Raif M. Rustamov:
Template Based Shape Descriptor. 3DOR@Eurographics 2009: 1-7 - [c3]Raif M. Rustamov:
On Mesh Editing, Manifold Learning, and Diffusion Wavelets. IMA Conference on the Mathematics of Surfaces 2009: 307-321 - 2008
- [j1]Raif M. Rustamov:
Augmented planar reflective symmetry transform. Vis. Comput. 24(6): 423-433 (2008) - 2007
- [c2]Raif M. Rustamov:
Laplace-Beltrami eigenfunctions for deformation invariant shape representation. Symposium on Geometry Processing 2007: 225-233 - [c1]Raif M. Rustamov:
Augmented Symmetry Transforms. Shape Modeling International 2007: 13-20
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint