1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2023
Match-And-Deform: Time Series Domain Adaptation through Optimal Transport and Temporal Alignment
François Painblanc, Laetitia Chapel, Nicolas Courty +3
While large volumes of unlabeled data are usually available, associated labels are often scarce. The unsupervised domain adaptation problem aims at exploiting labels from a source…
cs.CV2010★ 1 cited
Balancing clusters to reduce response time variability in large scale image search
Romain Tavenard, Laurent Amsaleg, Hervé Jégou
Many algorithms for approximate nearest neighbor search in high-dimensional spaces partition the data into clusters. At query time, in order to avoid exhaustive search, an index se…