From post

An Efficient Algorithm for Computing k-Average-Regret Minimizing Sets in Databases.

, и . WISA, том 11242 из Lecture Notes in Computer Science, стр. 404-412. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Efficient Approximate Algorithms for k-Regret Queries with Binary Constraints., , , и . WISA, том 11242 из Lecture Notes in Computer Science, стр. 421-433. Springer, (2018)An Efficient Algorithm for Computing k-Average-Regret Minimizing Sets in Databases., и . WISA, том 11242 из Lecture Notes in Computer Science, стр. 404-412. Springer, (2018)Accelerated algorithms for maximizing average happiness ratio in databases., , , и . Frontiers Comput. Sci., 15 (6): 156618 (2021)Distance-Based Continuous Skylines on Geo-Textual Data., , , и . APWeb Workshops, том 9865 из Lecture Notes in Computer Science, стр. 228-240. (2016)Speed-Up Algorithms for Happiness-Maximizing Representative Databases., , , и . APWeb/WAIM Workshops, том 11268 из Lecture Notes in Computer Science, стр. 321-335. Springer, (2018)