Skip to content <title>Channels - Robust Point Matching with Distance Profiles :: FRELIP Discovery

Home Search Guides Journals Learning

FRELIP Discovery Search

Open Access Catalog for African Scholarship

Channels
Robust Point Matching with Distance Profiles

Search for more channels:

Similar Items: Robust Point Matching with Distance Profiles

View Record
Explore related channels

Quick Look
Robust Point Matching with Distance Profiles
Quick Look
Robust Point Matching with Distance Profiles
Quick Look
Robust Point Matching with Distance Profiles
Quick Look
Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching
Quick Look
Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching
Quick Look
Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching
Quick Look
Bagged Regularized k-Distances for Anomaly Detection
Quick Look
Bagged Regularized k-Distances for Anomaly Detection
Quick Look
Bagged Regularized k-Distances for Anomaly Detection
Quick Look
Modelling Populations of Interaction Networks via Distance Metrics
Quick Look
Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds
Quick Look
Modelling Populations of Interaction Networks via Distance Metrics
Quick Look
Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds
Quick Look
Modelling Populations of Interaction Networks via Distance Metrics
Quick Look
Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds
Quick Look
On the Robustness of Kernel Goodness-of-Fit Tests
Quick Look
On the Robustness of Kernel Goodness-of-Fit Tests
Quick Look
On the Robustness of Kernel Goodness-of-Fit Tests
Quick Look
Mean Aggregator is More Robust than Robust Aggregators under Label Poisoning Attacks on Distributed Heterogeneous Data
Quick Look
Mean Aggregator is More Robust than Robust Aggregators under Label Poisoning Attacks on Distributed Heterogeneous Data
Quick Look
Mean Aggregator is More Robust than Robust Aggregators under Label Poisoning Attacks on Distributed Heterogeneous Data
Quick Look
Efficiently Escaping Saddle Points in Bilevel Optimization
Quick Look
Efficiently Escaping Saddle Points in Bilevel Optimization
Quick Look
Efficiently Escaping Saddle Points in Bilevel Optimization

About FRELIP

Free eLibrary Portal (FRELIP) provides access to academic resources, research materials, and scholarly publications from Nigerian universities and research institutions.

Quick Links

FRELIP Home
About FRELIP
Research Guides
Search Catalog

Resources

Indexed Records: 13,069+
RSS Feeds: 6,699+
Disciplines: 14
Subjects: 155

© 2026 FRELIP - Free eLibrary Portal | frelip.org | Powered by VuFind