2080 search results - page 98 / 416 » Measuring empirical computational complexity |
154
click to vote
COLT
2003
Springer
15 years 9 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
131
click to vote
JCSS
2006
15 years 4 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
161
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
147
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
Detecting and recognizing face images automatically is a difficult task due to the variability of illumination, presentation angle, face expression and other common problems of m...
124
click to vote
TCOM
2010
15 years 2 months ago
2010
Abstract—This paper investigates the distribution of the condition number of complex Wishart matrices. Two closely related measures are considered: the standard condition number ...