2040 search results - page 27 / 408 » Approximate Expectation Maximization |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
100
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
167
click to vote
KES
2011
Springer
14 years 6 months ago
2011
Springer
When students study for multiple-choice cloze tests as the Test of English for International Communication (TOEIC), they tend to repeatedly tackle questions of the same type. In su...
TIT
2010
14 years 6 months ago
2010
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, ...
106
click to vote
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we derive an optimal resource allocation algorithm for ergodic weighted-sum capacity maximization in OFDMA systems assuming the availability of only partial (imperfe...