Enrique Fita Sanmartin
4 papers · 2019–2022 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
π
Conference Polyglot Β· Bronze
π
Interdisciplinary Bridge Β· Gold
πΊοΈ
Taxonomy Completionist
(11)
π
Keyword Champion
(2)
π
Trend Setter
Venues
Research topics
Keywords
semi-supervised learning
(3)
spanning forest
(2)
seeded segmentation
(2)
random walker
(2)
continuous optimization
(1)
directed graph
(1)
gibbs distribution
(1)
network optimization
(1)
geometric optimization
(1)
probabilistic model
(1)
graph cut
(1)
randomized algorithm
(1)
matrix tree theorem
(1)
minimum cut
(1)
random walker algorithm
(1)
karger's algorithm
(1)
minimum spanning forest
(1)
harmonic energy minimization
(1)
branched transport
(1)
combinatorial optimization
(1)
Papers
Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources
NeurIPS 2022
Directed Probabilistic Watershed
NeurIPS 2021
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice
ICCV 2021
Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning
NeurIPS 2019