Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,623
Rank Aggregation Methods for the Web
, 2010
"... We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking functions, selecting documents based on multiple criteria, and improving search precision through word associations. Wed ..."
Abstract
-
Cited by 478 (6 self)
- Add to MetaCart
. Wedevelop a set of techniques for the rank aggregation problem and compare their performance to that of well-known methods. A primary goal of our work is to design rank aggregation techniques that can effectively combat "spam," a serious problem in Web searches. Experiments show that our methods
On Maximum Rank Aggregation Problems
"... The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways. In this work we study a collection of distances, including the Kendall tau ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways. In this work we study a collection of distances, including the Kendall
The Aggregation Problem for Deliberative Democracy
"... Deliberating about what to do is often cast as an alternative to aggregating people’s preferences or opinions over what to do, and this makes good sense. Those of us in ..."
Abstract
- Add to MetaCart
Deliberating about what to do is often cast as an alternative to aggregating people’s preferences or opinions over what to do, and this makes good sense. Those of us in
An Efficient Approach for the Rank Aggregation Problem
"... This paper presents some computational properties of the Rank-Distance, a measure of similarity between partial rankings. We show how this distance generalizes the Spearman footrule distance, preserving its good computational complexity: the Rank-Distance between two partial rankings can be computed ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
be computed in linear time, and the rank aggregation problem can be solved in polynomial time. Further, we present a generalization of the Rank-Distance to strings, which permits to solve the median string problem in polynomial time. This appears rather surprising to us given the fact that for non
On the Hardness of Maximum Rank Aggregation Problems
"... The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. The alternatives are expressed by permutations, whose pairwise distance can be measured in many ways. In this work we study a collection of distances, includi ..."
Abstract
- Add to MetaCart
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. The alternatives are expressed by permutations, whose pairwise distance can be measured in many ways. In this work we study a collection of distances
Heuristic Evaluation of User Interfaces
- IN: PROCEEDINGS OF THE CHI´90 CONFERENCE, SEATTLE
, 1990
"... Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four ex-periments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found betw ..."
Abstract
-
Cited by 517 (4 self)
- Add to MetaCart
between 20 and 51 % of the usability problems in the interfaces they evaluated. On the other hand, we could aggregate the evaluations from several evaluators to a single evaluation and such aggregates do rather well, even when they consist of only three to five people.
On the Aggregation Problem for Synthesized Web Services
"... start The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates for component services. Upon receiving an artifact, an SWM selects a set of available services from a library to rea ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
start The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates for component services. Upon receiving an artifact, an SWM selects a set of available services from a library
Optimization Flow Control, I: Basic Algorithm and Convergence
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract
-
Cited by 694 (64 self)
- Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract
-
Cited by 757 (102 self)
- Add to MetaCart
as model construction. An operational semantics is provided for PEPA and its use to generate an underlying Markov process for any PEPA model is explained and demonstrated. Model simplification and state space aggregation have been proposed as means to tackle the problems of large performance models
Results 1 - 10
of
9,623
