6045 search results - page 316 / 1209 » Computable Linearizations of Well-partial-orderings |
179
click to vote
JMLR
2008
15 years 7 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
190
click to vote
MP
2006
15 years 7 months ago
2006
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
210
click to vote
CIE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
182
click to vote
PQCRYPTO
2010
15 years 11 months ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
240
click to vote
ICMLA
2008
15 years 8 months ago
2008
Time-series segmentation in the fully unsupervised scenario in which the number of segment-types is a priori unknown is a fundamental problem in many applications. We propose a Ba...