524 search results - page 98 / 105 » ets 2010 |
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
There is a number of recent research lines addressing complex negotiations in highly rugged utility spaces. However, most of them focus on overcoming the problems imposed by the c...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
A communication channel from an honest sender A to an honest receiver B can be described as a system with three interfaces labeled A, B, and E (the adversary), respectively, where...
DEXAW
2010
IEEE
13 years 7 months ago
2010
IEEE
— One of the central issues in Learning to Rank (L2R) for Information Retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures ...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...