activity
20112017
most citedEpsilon-complexity of continuous functions

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.ST2017

Models with varying structure

Boris Brodsky, Boris Darkhovsky

In this paper the problems of the retrospective analysis of models with time-varying structure are considered. These models include contamination models with randomly switching par…

stat.AP2016★ 1 cited

Binary classification of multi-channel EEG records based on the -complexity of continuous vector functions

Boris Darkhovsky, Alexandra Piryatinska, Alexander Kaplan

A methodology for binary classification of EEG records which correspond to different mental states is proposed. This model-free methodology is based on our theory of the -comple…

math-ph2013★ 1 cited

Epsilon-complexity of continuous functions

Boris Darkhovsky, Alexandra Pyriatinska

A formal definition of epsilon-complexity of an individual continuous function defined on a unit cube is proposed. This definition is consistent with the Kolmogorov's idea of the c…

math.ST2013

Asymptotically Optimal Detection of Changes in Stochastic Models with Switching Regimes

Boris Brodsky, Boris Darkhovsky

This paper deals with the problem of asymptotically optimal detection of changes in regime-switching stochastic models. We need to divide the whole obtained sample of data into sev…

math.ST2011

Retrospective change-point detection and estimation in multivariate linear models

Boris Brodsky, Boris Darkhovsky

In this paper the problem of retrospective change-point detection and estimation in multivariate linear models is considered. The lower bounds for the error of change-point estimat…