We uncover connections between maximum likelihood estimation in statistics and norm minimization over a group orbit invariant theory. focus on Gaussian transformation families, which include matrix normal models graphical given by transitive directed acyclic graphs. use stability under actions to characterize boundedness of the likelihood, existence uniqueness estimate. Our approach reveals pro...

In this paper we consider a combinatorial optimisation problem that takes as input graph in which some of the vertices have been preassigned to colours. The aim is then identify largest induced subgraph all remaining are able assume same colour their neighbours. This shares similarities with colouring problem, vertex cut problems, and maximum happy problem. It NP-hard general. derive number upp...

The Maximum Satisfiability (MAXSAT) problem is an optimization version of the (SAT) in which one given a CNF formula with n variables and needs to find maximum number simultaneously satisfiable clauses. Recent works achieved significant progress proving new upper bounds on worst-case computational complexity MAXSAT. All these reduce general MAXSAT special case where each variable appears small ...

introduction studying motility of biological objects is an important parameter in many biomedical processes. therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. materials and methods in the proposed method of this article, a hypothesis testing function is defined to separate biological particles from artifact and noise in captured v...

It is a quite common that acquired images are noisy and image filtering is a necessary step to enhance them. Usually image filtering effectiveness is characterized in terms of MSE or PSNR although nowadays it is well understood that these criteria do not always correspond adequately to visual perception of processed images. Recently several new measures of image quality have been proposed. In p...