2588 search results - page 16 / 518 » Applications of Kolmogorov complexity to computable model th... |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we survey the primary research, both theoretical and applied, in the area of Robust Optimization (RO). Our focus is on the computational attractiveness of RO approac...
CHI
2007
ACM
15 years 11 months ago
2007
ACM
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
ISCAS
2007
IEEE
15 years 5 months ago
2007
IEEE
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
116
click to vote
LICS
2012
IEEE
13 years 1 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
110
click to vote
AUTOMATICA
2008
14 years 11 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...