217 search results - page 14 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
CVPR
2004
IEEE
15 years 1 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
This paper explores hybrid agents that use a variety of techniques to improve their performance in an environment over time. We considered, specifically, geneticlearning-parentin...