Results 11 to 20 of about 1,650,745 (287)
The rank pricing problem with ties [PDF]
European Journal of Operational Research, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domínguez, Concepción +2 more
openaire +5 more sources
Lagrangian Inference for Ranking Problems
Operations Research, 2023 Understanding ranking orders of different items is of great importance in many applications such as sports, online game, and recommendation, among many others. This paper provides a novel approach to inferring the ranking systems. In particular, the paper aims to answer questions like, is item A better than item B?
Yue Liu, Ethan X. Fang, Junwei Lu
openaire +2 more sources
A Higher-Rank Mersenne Problem [PDF]
, 2002 The classical Mersenne problem has been a stimulating challenge to number theorists and computer scientists for many years. After briefly reviewing some of the natural settings in which this problem appears as a special case, we introduce an analogue of the Mersenne problem in higher rank, in both a classical and an elliptic setting. Numerical evidence
Everest, G., Rogers, P., Ward, T.
openaire +4 more sources
ORTP: A Video SAR Imaging Algorithm Based on Low-Tubal-Rank Tensor Recovery
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2022 Video synthetic aperture radar (SAR) is attracting more and more attention because of its continuous imaging capability for ground scene of interest under any weather conditions and any time of the day.
Wei Pu +3 more
doaj +1 more source
Approximate Message Passing for Structured Affine Rank Minimization Problem
IEEE Access, 2017 The topic of the rank minimization problem with affine constraints has been well studied in recent years. However, in many applications the data can exhibit other structures beyond simply being low rank.
Yangqing Li +3 more
doaj +1 more source
Eliminating Rank Reversal Problem Using a New Multi-Attribute Model—The RAFSI Method
Mathematics, 2020 Multi-attribute decision-making (MADM) methods represent reliable ways to solve real-world problems for various applications by providing rational and logical solutions.
Mališa Žižović +4 more
doaj +1 more source
M-ary Rank Classifier Combination: A Binary Linear Programming Problem
Entropy, 2019 The goal of classifier combination can be briefly stated as combining the decisions of individual classifiers to obtain a better classifier. In this paper, we propose a method based on the combination of weak rank classifiers because rankings contain ...
Vincent Vigneron, Hichem Maaref
doaj +1 more source
Best rank k approximation for binary forms [PDF]
, 2017 In the tensor space $\mathrm{Sym}^d {\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a hyperplane. We prove
Ottaviani, Giorgio, Tocino, Alicia
core +3 more sources
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria [PDF]
, 2014 Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was
A McLennan +10 more
core +1 more source
Local Ranking Problem on the BrowseGraph [PDF]
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015 The "Local Ranking Problem" (LRP) is related to the computation of a centrality-like rank on a local graph, where the scores of the nodes could significantly differ from the ones computed on the global graph. Previous work has studied LRP on the hyperlink graph but never on the BrowseGraph, namely a graph where nodes are webpages and edges are browsing
M. Trevisiol +3 more
openaire +3 more sources