Sciweavers

427 search results - page 59 / 86
» Sequential predictions based on algorithmic complexity
Sort
View
142
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Evaluating music sequence models through missing data
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
Thierry Bertin-Mahieux, Graham Grindlay, Ron J. We...
121
Voted
BMCBI
2008
170views more  BMCBI 2008»
15 years 2 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini
ALMOB
2008
95views more  ALMOB 2008»
15 years 2 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
157
Voted
ATAL
2011
Springer
14 years 2 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
STACS
1999
Springer
15 years 6 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann