Sciweavers

1240 search results - page 15 / 248
» Composition with Target Constraints
Sort
View
MP
1998
134views more  MP 1998»
15 years 1 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
LREC
2008
120views Education» more  LREC 2008»
15 years 3 months ago
Division of Example Sentences Based on the Meaning of a Target Word Using Semi-Supervised Clustering
In this paper, we describe a system that divides example sentences (data set) into clusters, based on the meaning of the target word, using a semi-supervised clustering technique....
Hiroyuki Shinnou, Minoru Sasaki
ICIP
2004
IEEE
16 years 3 months ago
A set theoretic approach to target detection using spectral signature statistics
Pixels in hyperspectral images usually contain spectra from several classifiable objects, so that the recorded pixel is a mixture of the classes. Current methods estimate the prop...
David M. Rouse, H. Joel Trussell
CP
2009
Springer
16 years 2 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
SARA
2009
Springer
15 years 8 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...