Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Prosenjit Gupta"'
Publikováno v:
Theoretical Computer Science. 814:210-222
Top-k query processing is an important building block for ranked retrieval, with various applications. In this paper, we consider two interesting top-k retrieval problems. In the first problem, we consider the r-combinations of a set S of n real numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92d7257d01655ccea5e74705f8395c74
https://doi.org/10.1016/j.tcs.2020.01.036
https://doi.org/10.1016/j.tcs.2020.01.036
Publikováno v:
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 27:637-668
Majority of the e-commerce sites implement Recommender Systems (RS) to help users navigate through the large search space and assist their decision making process by suggesting products that the user may like. Collaborative Filtering (CF) is the most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d9555a66c925225c3ae9513d3bf45d0
https://doi.org/10.1142/s0218488519500284
https://doi.org/10.1142/s0218488519500284
Publikováno v:
Information Processing & Management. 58:102566
Collaborative filtering based recommender systems typically suffer from scalability issues when new users and items join the system at a very rapid rate. We tackle this concerning issue by employing a decomposition based recommendation approach. We p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e349631bff0c1e6814c84140685c50f9
https://doi.org/10.1016/j.ipm.2021.102566
https://doi.org/10.1016/j.ipm.2021.102566
Autor:
Prosenjit Gupta, Ananda Swarup Das
Publikováno v:
Information Processing Letters. 116:361-366
Let S be a set of n points on an n × n integer grid. The maximal layer of S is a set of points in S that are not dominated by any other point in S. Considering Q as an axes-parallel query rectangle, we design an adaptive space efficient data structu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d30fd5af7f37ba2edd2ca65aa4bff247
https://doi.org/10.1016/j.ipl.2016.01.001
https://doi.org/10.1016/j.ipl.2016.01.001
Autor:
Akarsh Srivastava, Shronit Bhargava, Aman Jain, Prosenjit Gupta, Rajdeep Mukherjee, Ashwin Jayadev
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789811082368
Recommender systems attempt to predict the future behavior of a particular individual based on her past preferences. Today any individual may have more than one profile that he/she maintains on various websites, and leveraging all this data on the pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14fe399f0138e3edaa738e10dcf1e9b3
https://doi.org/10.1007/978-981-10-8237-5_46
https://doi.org/10.1007/978-981-10-8237-5_46
Publikováno v:
Journal of Discrete Algorithms. 30:78-95
In this work we show that given a set S of n points with coordinates on an n × n grid, we can construct data structures for (i) reporting and (ii) counting the maximal points in an axes-parallel query rectangle in sub-logarithmic time. We assume our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6e214cbd883d3034972ed22ec3462a1
https://doi.org/10.1016/j.jda.2014.12.002
https://doi.org/10.1016/j.jda.2014.12.002
Publikováno v:
Information Processing Letters. 114:256-263
In this work, we consider the problem of finding the closest pair (in L"1 metric) of points in an orthogonal query rectangle. Given a set of n static points on a UxU grid, we preprocess these points into a data structure of size O(mf(m)log^2m) that c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb7d6869b12d419620b203ef0bd87b14
https://doi.org/10.1016/j.ipl.2013.12.006
https://doi.org/10.1016/j.ipl.2013.12.006
Publikováno v:
Computational Geometry. 47:329-347
A fundamental and well-studied problem in computational geometry is range searching, where the goal is to preprocess a set, S, of geometric objects (e.g., points in the plane) so that the subset S^'@?S that is contained in a query range (e.g., an axe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::417ae42fcc993914bc53d6eea9feccd7
https://doi.org/10.1016/j.comgeo.2009.08.001
https://doi.org/10.1016/j.comgeo.2009.08.001
Publikováno v:
Information Processing Letters. 113:777-784
Top-K query processing is an important building block for ranked retrieval, with numerous applications. Top-K queries return a ranked set of the k best data objects based on the ranks/scores of the objects, assigned by some ranking/scoring function.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0972dedf7a2c091cc077384b5f3d0fae
https://doi.org/10.1016/j.ipl.2013.07.013
https://doi.org/10.1016/j.ipl.2013.07.013
Autor:
Prosenjit Gupta, Debajyoti Ghosh
Publikováno v:
2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC).
Location Based Services integrate the knowledge of the geographical location of a mobile device with other information to provide various services. Successful provisioning of LBS systems had been hindered in the past by various infrastructure constra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aaa17f2f82d13f1ed3198c82bf664d6d
https://doi.org/10.1109/iccic.2016.7919596
https://doi.org/10.1109/iccic.2016.7919596