Results 271 to 280 of about 606,719 (306)
Some of the next articles are maybe not open access.
Proceeding Structure in Complexity Theory, 1987
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function $f$ so that for all $x, f(x)$ computes the number of elements of $A$ that are lexicographically $\leq x$, i.e., the rank of $x$ with respect to $A$. We'll say a class $C$ is P-rankable if all sets in $C$ are P-rankable.
openaire +2 more sources
This paper structurally characterizes the complexity of ranking. A set is P-rankable if there is a polynomial time computable function $f$ so that for all $x, f(x)$ computes the number of elements of $A$ that are lexicographically $\leq x$, i.e., the rank of $x$ with respect to $A$. We'll say a class $C$ is P-rankable if all sets in $C$ are P-rankable.
openaire +2 more sources
SIAM Journal on Computing, 1985
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Andrew V. Goldberg, Michael Sipser
openaire +3 more sources
A notion of language compressibility is defined and it is proved that in a sufficiently sparse and ``easy''-computable language essentially all strings can be compressed efficiently. Similar results hold for a type of optimal compression (ranking). Examples of languages that cannot be compressed/ranked efficiently are also presented, as well as some ...
Andrew V. Goldberg, Michael Sipser
openaire +3 more sources
Fundamenta Informaticae, 2018
In this paper we introduce a new ranking algorithm, called Collaborative Judgement (CJ), that takes into account peer opinions of agents and/or humans on objects (e.g. products, exams, papers) as well as peer judgements over those opinions. The combination of these two types of information has not been studied in previous work in order to produce ...
Ewa Andrejczuk +2 more
openaire +2 more sources
In this paper we introduce a new ranking algorithm, called Collaborative Judgement (CJ), that takes into account peer opinions of agents and/or humans on objects (e.g. products, exams, papers) as well as peer judgements over those opinions. The combination of these two types of information has not been studied in previous work in order to produce ...
Ewa Andrejczuk +2 more
openaire +2 more sources
Business & Society, 1999
Using ethical theory often applied by business ethicists, this article develops a threshold definition of honesty that incorporates specific situational factors (act, actor, person affected, intention, and result) in the definition: Dishonesty occurs when a responsible actor voluntarily and intentionally violates some convention of the transfer of ...
Elizabeth D. Scott, Karen A. Jehn
openaire +1 more source
Using ethical theory often applied by business ethicists, this article develops a threshold definition of honesty that incorporates specific situational factors (act, actor, person affected, intention, and result) in the definition: Dishonesty occurs when a responsible actor voluntarily and intentionally violates some convention of the transfer of ...
Elizabeth D. Scott, Karen A. Jehn
openaire +1 more source
When does rank( ABC ) = rank( AB ) + rank( BC ) - rank( B ) hold?
International Journal of Mathematical Education in Science and Technology, 2002The well-known Frobenius rank inequality established by Frobenius in 1911 states that the rank of the product ABC of three matrices satisfies the inequality rank(ABC) U rank(AB) + rank(BC)- rank(B) A new necessary and sufficient condition for equality to hold is presented and then some interesting consequences and applications are discussed.
Yongge Tian, George P. H. Styan
openaire +1 more source
Ranking ranks: a ranking algorithm for bootstrapping from the empirical copula
Computational Statistics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blumentritt, Thomas, Grothe, Oliver
openaire +2 more sources
Image Re-ranking and Rank Aggregation Based on Similarity of Ranked Lists
Pattern Recognition, 2011In Content-based Image Retrieval (CBIR) systems, ranking accurately collection images is of great relevance. Users are interested in the returned images placed at the first positions, which usually are the most relevant ones. Collection images are ranked in increasing order of their distance to the query pattern (e.g., query image) defined by users ...
Daniel Carlos Guimarães Pedronette +1 more
openaire +3 more sources
Ensemble Ranking SVM for learning to rank
2011 IEEE International Workshop on Machine Learning for Signal Processing, 2011This paper deals with the problem of learning to rank documents for information retrieval. Until now, Ranking SVM has been successfully used for learning to rank documents. The basic idea of Ranking SVM is to formalize learning to rank as a problem of binary classification on instance pairs and solve the problem using SVM.
Cheolkon Jung, Licheng Jiao, Yanbo Shen
openaire +1 more source
RANK-TO-RANK EMBEDDINGS AND STEEL’S CONJECTURE
The Journal of Symbolic Logic, 2020AbstractThis paper establishes a conjecture of Steel [7] regarding the structure of elementary embeddings from a level of the cumulative hierarchy into itself. Steel’s question is related to the Mitchell order on these embeddings, studied in [5] and [7].
openaire +2 more sources
Collaborative Ranking with Ranking-Based Neighborhood
2013Recommendation system is a very important tool to help users to find what they are interested in on the web. In many commercial recommendation systems, only the top-K items are shown to users, and recommendation becomes a ranking task rather than a classical rating prediction task.
Chaosheng Fan, Zuoquan Lin
openaire +2 more sources