نتایج جستجو برای: rank performance

تعداد نتایج: 1114119  

Journal: :Appl. Math. Lett. 2004
Andreas W. M. Dress Stefan Grünewald Dragan Stevanovic

Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic gr...

Journal: :CoRR 2016
Avradeep Bhowmik Joydeep Ghosh

Learning the true ordering between objects by aggregating a set of expert opinion rank order lists is an important and ubiquitous problem in many applications ranging from social choice theory to natural language processing and search aggregation. We study the problem of unsupervised rank aggregation where no ground truth ordering information in available, neither about the true preference orde...

2013
Yan Pan Hanjiang Lai Cong Liu Yong Tang Shuicheng Yan

Rank aggregation, which combines multiple individual rank lists to obtain a better one, is a fundamental technique in various applications such as meta-search and recommendation systems. Most existing rank aggregation methods blindly combine multiple rank lists with possibly considerable noises, which often degrades their performances. In this paper, we propose a new model for robust rank aggre...

Journal: :Neural computation 2017
Shashanka Ubaru Abd-Krim Seghouane Yousef Saad

This letter considers the problem of dictionary learning for sparse signal representation whose atoms have low mutual coherence. To learn such dictionaries, at each step, we first update the dictionary using the method of optimal directions (MOD) and then apply a dictionary rank shrinkage step to decrease its mutual coherence. In the rank shrinkage step, we first compute a rank 1 decomposition ...

2015
Jose Luiz Dantas Gleber Pereira Fabio Yuzo Nakamura

BACKGROUND The five-kilometer time trial (TT5km) has been used to assess aerobic endurance performance without further investigation of its validity. OBJECTIVES This study aimed to perform a preliminary validation of the TT5km to rank well-trained cyclists based on aerobic endurance fitness and assess changes of the aerobic endurance performance. MATERIALS AND METHODS After the incremental ...

Ebrahimi-Nejad, S., Kheybari, M.,

Brake system performance significantly affects safety, handling and vehicle dynamics. Therefore, the objective of this paper is to discuss brake system characteristics and performance and component design parameters. We perform a detailed study of a specific brake system designed for Mercedes-AMG SLC-43, considering component design parameters and operational points, and finally conduct the veh...

The COVID-19 pandemic has affected many people around the globe. Europe, as one of the most seriously affected continents, has been struggling with the novel coronavirus for several months. Obviously, outbreak response management plays a critical role in the impact of the disease. Therefore, in this paper, Malmquist Productivity Index is used to evaluate the performance of the most severely aff...

Journal: :SIAM Journal on Optimization 2013
Bamdev Mishra Gilles Meyer Francis R. Bach Rodolphe Sepulchre

The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equ...

Journal: :journal of mahani mathematical research center 0
hamid reza afshin vali-e-asr university of rafsanjan hadis izadi vali-e-asr university of rafsanjan mohammad ali mehrjoofard vali-e-asr university of rafsanjan

in this note, a generalization of higher rank numerical range isintroduced and some of its properties are investigated

2008
Reza Akbarinia Ihab F. Ilyas M. Tamer Özsu Patrick Valduriez

Top-k join queries have become very important in many important areas of computing. One of the most efficient algorithms for top-k join queries is the Rank-Join algorithm [17] [18]. However, there are many cases where Rank-Join does much unnecessary access to the input data sources. In this report, we first show that there are many cases where Rank-Join's stopping mechanism is not efficient, an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید