After running matrix factorization algorithms, every user/item can be represented as a vector in f-dimensional space. This library helps us search for similar users/items. We have many millions of tracks in a high-dimensional space, so memory usage is a prime concern. Annoy was built by ...
Cheng, M.X., Gong, X.: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. J. Global Optim. 51(3), 447–462 (2011) Article MATH Google Scholar Cheng, M.X., Ruan, L., Wu, W.: Achieving minimum coverage breach under bandwidth constraints in wireless sensor ne...
Part of the book series:Lecture Notes in Computer Science((LNTCS,volume 11926)) Included in the following conference series: International Workshop on Approximation and Online Algorithms 657Accesses Abstract We show that the strong chromatic index of unit disk graphs is efficiently 6-approximable. ...
Maximum lifetime scheduling for target coverage and data collection in wireless sensor networks 2015, IEEE Transactions on Vehicular Technology A ptas for theweighted unit disk cover problem 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture ...