Provably Adversarially Robust Nearest Prototype Classifiers. | 0 | 0.34 | 2022 |
Breaking Down Out-of-Distribution Detection: Many Methods Based on OOD Training Data Estimate a Combination of the Same Core Quantities. | 0 | 0.34 | 2022 |
Evaluating the Adversarial Robustness of Adaptive Test-time Defenses. | 0 | 0.34 | 2022 |
The Global Convergence of the Nonlinear Power Method for Mixed-Subordinate Matrix Norms. | 0 | 0.34 | 2021 |
Bit Error Robustness for Energy-Efficient DNN Accelerators. | 0 | 0.34 | 2021 |
Learnable uncertainty under Laplace approximations. | 0 | 0.34 | 2021 |
Provable robustness against all adversarial $l_p$-perturbations for $p\geq 1$ | 0 | 0.34 | 2020 |
Scaling up the randomized gradient-free adversarial attack reveals overestimation of robustness using established attacks. | 1 | 0.37 | 2019 |
Sparse And Imperceivable Adversarial Attacks | 3 | 0.37 | 2019 |
Regularization-free estimation in trace regression with symmetric positive semidefinite matrices. | 1 | 0.36 | 2015 |
Hitting and commute times in large random neighborhood graphs | 19 | 0.89 | 2014 |
Constrained fractional set programs and their application in local clustering and community detection. | 1 | 0.39 | 2013 |
Towards realistic team formation in social networks based on densest subgraphs | 31 | 0.94 | 2013 |
Constrained 1-Spectral Clustering | 0 | 0.34 | 2012 |
Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291). | 0 | 0.34 | 2011 |
How the result of graph clustering methods depends on the construction of the graph | 12 | 0.58 | 2011 |
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA | 46 | 1.74 | 2010 |
Nonparametric Regression between General Riemannian Manifolds | 7 | 0.50 | 2010 |
Hitting times, commute distances and the spectral gap for large random geometric graphs | 3 | 1.22 | 2010 |
Getting lost in space: Large sample analysis of the resistance distance. | 21 | 0.96 | 2010 |
Semi-supervised Regression using Hessian energy with an application to semi-supervised dimensionality reduction. | 40 | 1.25 | 2009 |
Large-scale antibody profiling of human blood sera: The future of molecular diagnosis | 0 | 0.34 | 2009 |
Spectral clustering based on the graph p-Laplacian | 70 | 2.41 | 2009 |
Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters | 41 | 3.07 | 2009 |
Manifold-Valued Thin-Plate Splines With Applications In Computer Graphics | 2 | 0.41 | 2008 |
Influence of graph construction on graph-based clustering measures | 23 | 1.49 | 2008 |
Non-parametric Regression Between Manifolds | 2 | 0.37 | 2008 |
Enhancement of bright video features for HDR displays | 33 | 1.41 | 2008 |
Cluster Identification in Nearest-Neighbor Graphs | 13 | 1.13 | 2007 |
Graph Laplacians and their Convergence on Random Neighborhood Graphs | 64 | 5.58 | 2007 |
Manifold denoising as preprocessing for finding natural representations of data | 4 | 0.44 | 2007 |
Manifold Denoising | 10 | 1.13 | 2006 |
Uniform convergence of adaptive graph-based regularization | 11 | 3.84 | 2006 |
From graphs to manifolds – weak and strong pointwise consistency of graph laplacians | 81 | 10.96 | 2005 |
Intrinsic dimensionality estimation of submanifolds in Rd | 56 | 3.13 | 2005 |
Maximal margin classification for metric spaces | 28 | 4.82 | 2005 |
Hilbertian Metrics on Probability Measures and Their Application in SVM?s | 6 | 2.11 | 2004 |
Measure Based Regularization | 34 | 7.56 | 2003 |