Sciweavers

32 search results - page 3 / 7
» NP-hardness results for the aggregation of linear orders int...
Sort
View
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
13 years 11 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
ECML
2007
Springer
13 years 11 months ago
An Unsupervised Learning Algorithm for Rank Aggregation
Many applications in information retrieval, natural language processing, data mining, and related fields require a ranking of instances with respect to a specified criteria as op...
Alexandre Klementiev, Dan Roth, Kevin Small
MFCS
2009
Springer
13 years 10 months ago
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
Nadja Betzler, Britta Dorn
ICASSP
2011
IEEE
12 years 9 months ago
Compressed classification of observation sets with linear subspace embeddings
We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of r...
Dorina Thanou, Pascal Frossard
JCSS
2010
112views more  JCSS 2010»
13 years 4 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn