2031 search results - page 8 / 407 » On Tree-Constrained Matchings and Generalizations |
JSC
2008
14 years 9 months ago
2008
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
100
click to vote
ACL
2008
14 years 11 months ago
2008
This paper presents a semi-supervised training method for linear-chain conditional random fields that makes use of labeled features rather than labeled instances. This is accompli...
IPCO
1998
14 years 11 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
105
click to vote
DISOPT
2010
14 years 9 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
86
Voted
JMLR
2010
14 years 4 months ago
2010
In this paper, we present an overview of generalized expectation criteria (GE), a simple, robust, scalable method for semi-supervised training using weakly-labeled data. GE fits m...