555 search results - page 42 / 111 » Decompositions of Grammar Constraints |
147
click to vote
EACL
1993
ACL Anthology
15 years 7 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]...
164
click to vote
AIPS
1994
15 years 7 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...
137
click to vote
CVPR
2010
IEEE
16 years 2 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...
140
click to vote
ICASSP
2008
IEEE
16 years 19 days 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...
176
click to vote
JSAC
2006
15 years 6 months 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...