Search Results for author:
Found 3 papers, 2 papers with code
"Sliced" Subwindow Search: a Sublinear-complexity Solution to the Maximum Rectangle Problem
In general, our solution outperforms existing solutions when matrices are sufficiently large and a marginal decrease in accuracy is acceptable, such as in many problems involving natural images.
Matrix Factorization on GPUs with Memory Optimization and Approximate Computing
Current MF implementations are either optimized for a single machine or with a need of a large computer cluster but still are insufficient.
Faster and Cheaper: Parallelizing Large-Scale Matrix Factorization on GPUs
Matrix factorization (MF) is employed by many popular algorithms, e. g., collaborative filtering.
Distributed, Parallel, and Cluster Computing Performance
Cannot find the paper you are looking for? You can
Submit a new open access paper.
