51 search results - page 1 / 11 » Discovering bucket orders from full rankings |
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
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...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
TASLP
2010
12 years 11 months ago
2010
This article addresses the modeling of reverberant recording environments in the context of under-determined convolutive blind source separation. We model the contribution of each ...
PODS
2005
ACM
13 years 10 months ago
2005
ACM
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
IACR
2011
12 years 4 months ago
2011
GOST is a well known block cipher which was developed in the Soviet Union during the 1970’s as an alternative to the US-developed DES. In spite of considerable cryptanalytic eff...