562 search results - page 67 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
EMMCVPR
1999
Springer
14 years 10 days ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
SIAMJO
2008
13 years 8 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
IWLCS
2005
Springer
14 years 1 months ago
2005
Springer
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...