Sciweavers

164 search results - page 7 / 33
» The Kolmogorov complexity of random reals
Sort
View
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 2 months ago
Enumerating randoms
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
Bjørn Kjos-Hanssen, Frank Stephan, Jason Te...
ICISP
2010
Springer
14 years 6 days ago
Classification of High-Resolution NMR Spectra Based on Complex Wavelet Domain Feature Selection and Kernel-Induced Random Forest
High-resolution nuclear magnetic resonance (NMR) spectra contain important biomarkers that have potentials for early diagnosis of disease and subsequent monitoring of its progressi...
Guangzhe Fan, Zhou Wang, Seoung Bum Kim, Chivalai ...
BMCBI
2006
141views more  BMCBI 2006»
13 years 7 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
WEBI
2009
Springer
14 years 2 months ago
Specialized Review Selection for Feature Rating Estimation
—On participatory Websites, users provide opinions about products, with both overall ratings and textual reviews. In this paper, we propose an approach to accurately estimate fea...
Chong Long, Jie Zhang, Minlie Huang, Xiaoyan Zhu, ...
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov