Research map / Learning theory and algorithms / Prediction and decision losses
Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning
Enrique Fita Sanmartin, Sebastian Damrich, Fred A. Hamprecht
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Directed Probabilistic Watershed (NeurIPS 2021 · similarity 0.94)
- Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice (ICCV 2021 · similarity 0.88)
- Distribution Learning Meets Graph Structure Sampling (NeurIPS 2025 · similarity 0.84)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 2024 · similarity 0.84)
- Minimax Rates and Spectral Distillation for Tree Ensembles (NeurIPS 2026 · similarity 0.83)
- Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
