Sciweavers

2864 search results - page 387 / 573
» Constraint Programming in OPL
Sort
View
COLING
1994
13 years 10 months ago
Adjuncts and the Processing of Lexical Rules
The standard HPSG analysis of Germanic verb clusters can not explain the observed narrowscope readings of adjuncts in such verb clusters. We present an extension of the HPSG analy...
Gertjan van Noord, Gosse Bouma
ICASSP
2010
IEEE
13 years 9 months ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 9 months ago
Cardinality heterogeneities in Web service composition: Issues and solutions
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...
TCS
2008
13 years 9 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
TNN
2008
81views more  TNN 2008»
13 years 9 months ago
Nonlinear Knowledge-Based Classification
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorpora...
Olvi L. Mangasarian, Edward W. Wild