Results 11 to 20 of about 6,215,927 (306)
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 +6 more sources
On the rank minimization problem [PDF]
Proceedings of the 2004 American Control Conference, 2004 After a brief overview of the problem of finding the extremal (minimum or maximum) rank positive semidefinite matrix subject to matrix inequalities, we identify a few new classes of such problems that can be efficiently solved. We then proceed to present an algorithm for solving the general class of rank minimization problems.
Yoonsoo Kim 0001, Mehran Mesbahi
openaire +1 more source
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
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
Michele Trevisiol +3 more
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
Kleinian groups and the rank problem [PDF]
Geometry & Topology, 2005 Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol9/paper12.abs ...
Kapovich, Ilya, Weidmann, Richard
openaire +4 more sources
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
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
Graham Everest +2 more
openaire +4 more sources