Sciweavers

4372 search results - page 238 / 875
» Algorithmic Theories of Everything
Sort
View
HYBRID
2010
Springer
15 years 7 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
DAGSTUHL
2006
15 years 7 months ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
ICASSP
2010
IEEE
15 years 6 months ago
Hierarchical dictionary learning for invariant classification
Sparse representation theory has been increasingly used in the fields of signal processing and machine learning. The standard sparse models are not invariant to spatial transform...
Leah Bar, Guillermo Sapiro
PAMI
2006
440views more  PAMI 2006»
15 years 5 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
TRS
2008
15 years 5 months ago
A Model of User-Oriented Reduct Construction for Machine Learning
An implicit assumption of many machine learning algorithms is that all attributes are of the same importance. An algorithm typically selects attributes based solely on their statis...
Yiyu Yao, Yan Zhao, Jue Wang, Suqing Han