Search Results for author:
Found 2 papers, 1 papers with code
Sublinear Time Approximation of Text Similarity Matrices
Approximation methods reduce this quadratic complexity, often by using a small subset of exactly computed similarities to approximate the remainder of the complete pairwise similarity matrix.
U-PC: Unsupervised Planogram Compliance
We present an end-to-end solution for recognizing merchandise displayed in the shelves of a supermarket.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
