International audienceWe present two portable algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM) and we report on experimental studies of these algorithms. With these experiments, we study the validity of the chosen CGM model, and also show the possible gains and limits of such algorithms
The goal in Learning to Rank (LETOR) is to learn to order a novel set of items, given training data ...
Label ranking is a complex prediction task where the goal is to map instances to a total order over ...
Learning to Rank is an area of application in machine learning, typically supervised, to build ranki...
International audienceWe present two portable algorithms for the List Ranking Problem in the Coarse ...
We present two algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CG...
We consider the problem of ranking an N element fist on a P processor EREW PRAM. Recent work on this...
Abstract—We present analytical and experimental results for fine-grained list ranking algorithms. We...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
AbstractAlthough parallel algorithms using linked lists, trees, and graphs have been studied extensi...
Improved parallel, external and parallel-external algorithms for list-ranking and computing the conn...
Two improved list-ranking algorithms are presented. The ``peeling-off'' algorithm leads to an optima...
We present analytical and experimental results for fine-grained list ranking algorithms, with the ob...
Novel algorithms are presented for parallel and external memory list-ranking. The same algorithms ca...
The Wyllie’s list ranking algorithm takes a linked list data structure as an input and it pass the l...
Learning to rank is a supervised learning problem that aims to construct a ranking model. The most c...
The goal in Learning to Rank (LETOR) is to learn to order a novel set of items, given training data ...
Label ranking is a complex prediction task where the goal is to map instances to a total order over ...
Learning to Rank is an area of application in machine learning, typically supervised, to build ranki...
International audienceWe present two portable algorithms for the List Ranking Problem in the Coarse ...
We present two algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CG...
We consider the problem of ranking an N element fist on a P processor EREW PRAM. Recent work on this...
Abstract—We present analytical and experimental results for fine-grained list ranking algorithms. We...
List ranking and list scan are two primitive operations used in many parallel algorithms that use li...
AbstractAlthough parallel algorithms using linked lists, trees, and graphs have been studied extensi...
Improved parallel, external and parallel-external algorithms for list-ranking and computing the conn...
Two improved list-ranking algorithms are presented. The ``peeling-off'' algorithm leads to an optima...
We present analytical and experimental results for fine-grained list ranking algorithms, with the ob...
Novel algorithms are presented for parallel and external memory list-ranking. The same algorithms ca...
The Wyllie’s list ranking algorithm takes a linked list data structure as an input and it pass the l...
Learning to rank is a supervised learning problem that aims to construct a ranking model. The most c...
The goal in Learning to Rank (LETOR) is to learn to order a novel set of items, given training data ...
Label ranking is a complex prediction task where the goal is to map instances to a total order over ...
Learning to Rank is an area of application in machine learning, typically supervised, to build ranki...
DOI
Add to ORKG