555 search results - page 42 / 111 » Decompositions of Grammar Constraints |
EACL
1993
ACL Anthology
15 years 2 months ago
1993
ACL Anthology
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
105
Voted
AIPS
1994
15 years 2 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
88
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
82
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
Nonnegative Tucker decomposition (NTD) is a recent multiway extension of nonnegative matrix factorization (NMF), where nonnegativity constraints are incorporated into Tucker model...
122
click to vote
JSAC
2006
15 years 19 days ago
2006
Abstract--Network performance can be increased if the traditionally separated network layers are jointly optimized. Recently, network utility maximization has emerged as a powerful...