672 search results - page 21 / 135 » A General Solution to the Graph History Interaction Problem |
JMLR
2010
13 years 2 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
ESA
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
HEURISTICS
2010
13 years 2 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
SIGUCCS
2003
ACM
14 years 22 days ago
2003
ACM
Working on a small campus has many advantages: Familiarity with the majority of faculty and staff, in-depth knowledge of how systems interact, adding the personal touch to each in...