This paper focuses on similarity caching systems, in which a user request for an object o that is not in the cache can be (partially) satisfied by a similar stored object o , at the cost of a loss of user utility. Similarity caching systems can be effectively employed in several application areas, like multimedia retrieval, recommender systems,...
-
April 27, 2020 (v1)Conference paperUploaded on: February 22, 2023
-
December 2021 (v1)Journal article
This paper focuses on similarity caching systems, in which a user request for an object o that is not in the cache can be (partially) satisfied by a similar stored object o', at the cost of a loss of user utility. Similarity caching systems can be effectively employed in several application areas, like multimedia retrieval, recommender systems,...
Uploaded on: December 3, 2022 -
December 2021 (v1)Journal article
Similarity caching systems have recently attracted the attention of the scientific community, as they can be profitably used in many application contexts, like multimedia retrieval, advertising, object recognition, recommender systems and online content-match applications. In such systems, a user request for an object , which is not in the...
Uploaded on: December 3, 2022 -
2022 (v1)Journal article
A similarity cache can reply to a query for an object with similar objects stored locally. In some applications of similarity caches, queries and objects are naturally represented as points in a continuous space. This is for example the case of 360 • videos where user's head orientation-expressed in spherical coordinates-determines what part of...
Uploaded on: February 22, 2023 -
May 10, 2021 (v1)Conference paper
A similarity cache can reply to a query for an object with similar objects stored locally. In some applications of similarity caches, queries and objects are naturally represented as points in a continuous space. Examples include 360° videos where user's head orientation-expressed in spherical coordinates determines what part of the video needs...
Uploaded on: December 3, 2022