314 search results - page 4 / 63 » Formulation Schema Matching Problem for Combinatorial Optimi... |
CORR
2010
Springer
13 years 9 days ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
WWW
2004
ACM
14 years 6 months ago
2004
ACM
In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema ...
ISVC
2007
Springer
13 years 11 months ago
2007
Springer
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...