3875 search results - page 611 / 775 » Approximation algorithms for the 0-extension problem |
162
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
146
click to vote
ALT
2008
Springer
16 years 2 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
161
click to vote
ATAL
2009
Springer
16 years 6 days ago
2009
Springer
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
164
Voted
ICRA
2005
IEEE
15 years 11 months ago
2005
IEEE
— In the real world, noisy sensors and limited communication make it difficult for robot teams to coordinate in tightly coupled tasks. Team members cannot simply apply single-ro...
131
Voted
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...