134 search results - page 5 / 27 » Experimental analysis of privacy loss in DCOP algorithms |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
ALGORITHMICA
2006
13 years 8 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
CSCLP
2006
Springer
14 years 13 days ago
2006
Springer
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
Queries describe the users' search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of exist...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...