Results 11 to 20 of about 496,714 (284)
Deep metric learning to rank [PDF]
2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2019 We propose a novel deep metric learning method by revisiting the learning to rank approach. Our method, named FastAP, optimizes the rank-based Average Precision measure, using an approximation derived from distance quantization.
Cakir, Fatih +4 more
core +2 more sources
The Electronic Journal of Combinatorics, 2023 We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We fully characterize the supersolvable rank-metric lattices and compute their characteristic polynomials.
Cotardo, Giuseppe, Ravagnani, Alberto
openaire +2 more sources
Divisible Linear Rank Metric Codes
IEEE Transactions on Information Theory, 2023 A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to ask whether or not all subspaces of matrices with such a property arise from a subspace of matrices over a larger
Olga Polverino +3 more
openaire +3 more sources
Column cyclic rank metric codes and linear complementary dual rank metric codes
Journal of Algebra and Its Applications, 2023 We introduce and study column cyclic rank metric (CCRM) codes over finite fields. We present natural questions for the existence and characterization of CCRM codes. We completely solve these questions only in the first nontrivial case: The case of the minimum rank distance [Formula: see text] and the number of rows [Formula: see text].
Javier de la Cruz, Ferruh Özbudak
openaire +4 more sources
Interleaving Loidreau’s Rank-Metric Cryptosystem [PDF]
2019 XVI International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY), 2019 We propose and analyze an interleaved variant of Loidreau's rank-metric cryptosystem based on rank multipliers. We analyze and adapt several attacks on the system, propose design rules, and study weak keys. Finding secure instances requires near-MRD rank-metric codes which are not investigated in the literature.
Renner, Julian +2 more
openaire +2 more sources
Metric-agnostic Ranking Optimization
Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023 Ranking is at the core of Information Retrieval. Classic ranking optimization studies often treat ranking as a sorting problem with the assumption that the best performance of ranking would be achieved if we rank items according to their individual utility.
Qingyao Ai +2 more
openaire +2 more sources
MRD rank metric convolutional codes [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 So far, in the area of Random Linear Network Coding, attention has been given to the so-called one-shot network coding, meaning that the network is used just once to propagate the information. In contrast, one can use the network more than once to spread redundancy over different shots. In this paper, we propose rank metric convolutional codes for this
Napp, Diego +3 more
openaire +2 more sources
Rank-metric codes and q-polymatroids [PDF]
Journal of Algebraic Combinatorics, 2019 This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of q-polymatroids to a rank-metric codes and show that several invariants and structural properties of the code, such as ...
Gorla, Elisa +3 more
openaire +3 more sources
Unsupervised Feature Selection via Metric Fusion and Novel Low-Rank Approximation
IEEE Access, 2022 Unsupervised feature selection aims to derive a compact set of features with desired generalization ability via removing the irrelevant and redundant features, yet challenging due to the unavailability of labels.
Yin Long +3 more
doaj +1 more source
Minkowski- versus Euclidean rank for products of metric spaces [PDF]
, 2001 We introduce a notion of the Euclidean- and the Minkowski rank for arbitrary metric spaces and we study their behaviour with respect to products. We show that the Minkowski rank is additive with respect to metric products, while additivity of the ...
Foertsch, Thomas, Schroeder, Viktor
core +1 more source