Sciweavers

32 search results - page 1 / 7
» NP-hardness results for the aggregation of linear orders int...
Sort
View
ANOR
2008
69views more  ANOR 2008»
13 years 4 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
INFOCOM
2011
IEEE
12 years 8 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
RECSYS
2009
ACM
13 years 11 months ago
Rating aggregation in collaborative filtering systems
Recommender systems based on user feedback rank items by aggregating users’ ratings in order to select those that are ranked highest. Ratings are usually aggregated using a weig...
Florent Garcin, Boi Faltings, Radu Jurca, Nadine J...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 4 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
CORR
1999
Springer
67views Education» more  CORR 1999»
13 years 4 months ago
Robust Combining of Disparate Classifiers through Order Statistics
: Integrating the outputs of multiple classifiers via combiners or meta-learners has led to substantial improvements in several difficult pattern recognition problems. In this arti...
Kagan Tumer, Joydeep Ghosh