7015 search results - page 420 / 1403 » Approximation algorithms for co-clustering |
196
click to vote
IJCAI
2007
15 years 8 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
221
click to vote
ICANN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Learning algorithms relying on Gibbs sampling based stochastic approximations of the log-likelihood gradient have become a common way to train Restricted Boltzmann Machin...
181
click to vote
OL
2007
15 years 6 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
146
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
178
click to vote
CD
2005
Springer
16 years 11 days ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...