The following pages link to Edwin R. Hancock (Q192439):
Displayed 50 items.
- Graph kernels from the Jensen-Shannon divergence (Q385342) (← links)
- Eigenfunctions of the edge-based Laplacian on a graph (Q389694) (← links)
- Quantum walks, Ihara zeta functions and cospectrality in regular graphs (Q544839) (← links)
- Efficient computation of Ihara coefficients using the Bell polynomial recursion (Q665963) (← links)
- Matching Delaunay graphs (Q676779) (← links)
- (Q743245) (redirect page) (← links)
- Obituary: Maria Petrou (1953--2012) (Q743246) (← links)
- A Riemannian approach to graph embedding (Q856472) (← links)
- Graph embedding using tree edit-union (Q869016) (← links)
- The modified Beckmann - Kirchhoff scattering theory for rough surface analysis (Q882222) (← links)
- A statistical approach to sparse multi-scale phase-based stereo (Q885202) (← links)
- Depth-based complexity traces of graphs (Q898379) (← links)
- Graph spectral image smoothing using the heat kernel (Q941573) (← links)
- Probabilistic relaxation labelling using the Fokker-Planck equation (Q941585) (← links)
- New Riemannian techniques for directional and tensorial image data (Q962734) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- Spectral embedding of graphs. (Q1403778) (← links)
- Learning mixtures of point distribution models with the EM algorithm. (Q1425973) (← links)
- Fast depth-based subgraph kernels for unattributed graphs (Q1669713) (← links)
- Concentric network symmetry (Q1671257) (← links)
- Ricci flow embedding for rectifying non-Euclidean dissimilarity data (Q1676956) (← links)
- A quantum Jensen-Shannon graph kernel for unattributed graphs (Q1677057) (← links)
- Corrigendum to: ``Coined quantum walks lift the cospectrality of graphs and trees'' (Q1678699) (← links)
- Spectral correspondence for point pattern matching (Q1856662) (← links)
- Storage capacity of the exponential correlation associative memory (Q1857466) (← links)
- Relational object recognition from large structural libraries (Q1860135) (← links)
- Recovering facial pose with the EM algorithm (Q1860164) (← links)
- Estimating the perspective pose of texture planes using spectral analysis on the unit sphere (Q1860172) (← links)
- Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054) (← links)
- Similarity analysis from limiting quantum walks (Q2027235) (← links)
- Graph characteristics from the heat kernel trace (Q2270728) (← links)
- Coined quantum walks lift the cospectrality of graphs and trees (Q2270832) (← links)
- Gender discriminating models from facial surface normals (Q2276027) (← links)
- Joint hypergraph learning and sparse regression for feature selection (Q2290324) (← links)
- Graph simplification and matching using commute times (Q2373488) (← links)
- Depth-based hypergraph complexity traces from directed line graphs (Q2416965) (← links)
- Heat kernel embeddings, differential geometry and graph structure (Q2422513) (← links)
- Quasi-isometric parameterization for texture mapping (Q2476582) (← links)
- Correspondence matching using kernel principal components analysis and label consistency constraints (Q2499110) (← links)
- A spectral approach to learning structural variations in graphs (Q2499134) (← links)
- A matrix representation of graphs and its spectrum as a graph invariant (Q2500953) (← links)
- (Q2703199) (← links)
- (Q2763448) (← links)
- Attributed Graph Similarity from the Quantum Jensen-Shannon Divergence (Q2873637) (← links)
- Entropy versus Heterogeneity for Graphs (Q3003442) (← links)
- Learning Generative Graph Prototypes Using Simplified von Neumann Entropy (Q3003443) (← links)
- A Graph-Based Approach to Feature Selection (Q3003466) (← links)
- An Entropic Edge Assortativity Measure (Q3300143) (← links)
- Coupled-Feature Hypergraph Representation for Feature Selection (Q3300148) (← links)
- A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks (Q3300155) (← links)