62 search results - page 5 / 13 » Approximating Node-Connectivity Augmentation Problems |
102
Voted
AAAI
2010
15 years 2 months ago
2010
Due to the non-stationary environment, learning in multi-agent systems is a challenging problem. This paper first introduces a new gradient-based learning algorithm, augmenting th...
154
click to vote
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
112
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
132
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
The bilateral filter is a nonlinear filter that smoothes a signal while preserving strong edges. It has demonstrated great effectiveness for a variety of problems in computer visio...
79
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...