2040 search results - page 159 / 408 » Approximate Expectation Maximization |
127
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
140
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
124
click to vote
SIGECOM
2010
ACM
15 years 8 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
154
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...