6045 search results - page 1053 / 1209 » Computable Linearizations of Well-partial-orderings |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
DEDS
2010
13 years 9 months ago
2010
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
CSDA
2008
13 years 9 months ago
2008
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
ENDM
2010
13 years 9 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
ENDM
2008
13 years 9 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...