2490 search results - page 139 / 498 » The Generalized Theory of Model Preference |
148
click to vote
MM
2004
ACM
15 years 10 months ago
2004
ACM
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
177
click to vote
AGENTCL
2003
Springer
15 years 9 months ago
2003
Springer
We propose group communication for agent coordination within “active rooms” and other pervasive computing scenarios featuring strict real-time requirements, inherently unrelia...
122
Voted
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
136
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
135
click to vote
AAAI
2006
15 years 6 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...