Zobrazeno 1 - 10
of 137
pro vyhledávání: '"Venturini, Rossano"'
Learned sparse representations form an effective and interpretable class of embeddings for text retrieval. While exact top-k retrieval over such embeddings faces efficiency challenges, a recent algorithm called Seismic has enabled remarkably fast, hi
Externí odkaz:
http://arxiv.org/abs/2408.04443
Learned sparse representations form an attractive class of contextual embeddings for text retrieval. That is so because they are effective models of relevance and are interpretable by design. Despite their apparent compatibility with inverted indexes
Externí odkaz:
http://arxiv.org/abs/2404.18812
Dense retrieval techniques employ pre-trained large language models to build a high-dimensional representation of queries and passages. These representations compute the relevance of a passage w.r.t. to a query using efficient similarity measures. In
Externí odkaz:
http://arxiv.org/abs/2404.02805
Quantization and pruning are two effective Deep Neural Networks model compression methods. In this paper, we propose Automatic Prune Binarization (APB), a novel compression technique combining quantization with pruning. APB enhances the representatio
Externí odkaz:
http://arxiv.org/abs/2306.08960
Given a text, rank and select queries return the number of occurrences of a character up to a position (rank) or the position of a character with a given rank (select). These queries have applications in, e.g., compression, computational geometry, an
Externí odkaz:
http://arxiv.org/abs/2302.09239
A tournament graph is a complete directed graph, which can be used to model a round-robin tournament between $n$ players. In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player
Externí odkaz:
http://arxiv.org/abs/2111.13621
Suppose an oracle knows a string $S$ that is unknown to us and that we want to determine. The oracle can answer queries of the form "Is $s$ a substring of $S$?". In 1995, Skiena and Sundaram showed that, in the worst case, any algorithm needs to ask
Externí odkaz:
http://arxiv.org/abs/2011.07143
Publikováno v:
Softw. Pract. Exp. 51(5): 921-949 (2021)
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range of applicat
Externí odkaz:
http://arxiv.org/abs/2006.14552
Publikováno v:
SIGIR 2020: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. July 2020. Pages 2271-2280
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems, suggesting possible ways of completing the query being typed by the user. Efficiency is crucial to make the system have a real-time responsiveness when operating i
Externí odkaz:
http://arxiv.org/abs/2005.06213