Sciweavers

6554 search results - page 968 / 1311
» Constraint Logic Programming
Sort
View
92
Voted
COLING
1994
15 years 6 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
141
Voted
ICASSP
2010
IEEE
15 years 5 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,...
TCS
2008
15 years 5 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
111
Voted
TNN
2008
81views more  TNN 2008»
15 years 5 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
CGF
2000
72views more  CGF 2000»
15 years 4 months ago
Priority-Driven Acoustic Modeling for Virtual Environments
Geometric acoustic modeling systems spatialize sounds according to reverberation paths from a sound source to a receiver to give an auditory impression of a virtual 3D environment...
Patrick Min, Thomas A. Funkhouser