3096 search results - page 162 / 620 » Theory and Use of the EM Algorithm |
130
Voted
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
152
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
156
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
163
click to vote
ISBI
2007
IEEE
15 years 11 months ago
2007
IEEE
According to the recent theory of compressed sensing, accurate reconstruction is possible even from data samples dramatically smaller than Nyquist sampling limit as long as the un...
153
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...