The following pages link to F. Escolano (Q1860131):
Displaying 21 items.
- Junction detection and grouping with probabilistic edge models and Bayesian \(A^{\ast}\) (Q1860133) (← links)
- Seeking affinity structure: strategies for improving \(m\)-best graph matching (Q1999054) (← links)
- Similarity analysis from limiting quantum walks (Q2027235) (← links)
- Protein classification by matching and clustering surface graphs (Q2369582) (← links)
- Depth-based hypergraph complexity traces from directed line graphs (Q2416965) (← links)
- Information-Geometric Graph Indexing from Bags of Partial Node Coverages (Q3003445) (← links)
- Information Theory in Computer Vision and Pattern Recognition (Q3394893) (← links)
- Thermodynamic Depth in Undirected and Directed Networks (Q3463391) (← links)
- Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering (Q3637705) (← links)
- (Q4422253) (← links)
- (Q4422255) (← links)
- (Q4450811) (← links)
- Graph Similarity through Entropic Manifold Alignment (Q4689636) (← links)
- TurboTensors for Entropic Image Comparison (Q4922146) (← links)
- Graph Characteristics from the Schrödinger Operator (Q4922161) (← links)
- Shape Simplification Through Graph Sparsification (Q5082141) (← links)
- On the Interplay Between Strong Regularity and Graph Densification (Q5082152) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316483) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316484) (← links)
- Constellations and the Unsupervised Learning of Graphs (Q5325752) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466390) (← links)
