163 search results - page 24 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
MM
2009
ACM
14 years 1 months ago
2009
ACM
In this work the problem of automatic decomposition of video into elementary semantic units, known in the literature as scenes, is addressed. Two multi-modal automatic scene segme...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
WDAG
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper presents a novel framework called proto-reinforcement learning (PRL), based on a mathematical model of a proto-value function: these are task-independent basis function...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...