Sorry, you need to enable JavaScript to visit this website.

The Viterbi algorithm and its pruning variant, are some of the most frequently used algorithms in communications and speech recognition. There has been extended research on improving the algorithms’ computational complexity, however work trying to interpret their nonlinear structure and geometry has been limited. In this work we analyse the Viterbi algorithm in the field of tropical (min-plus) algebra, and we utilize its pruning variant in order to define a polytope. Then, we interpret certain faces of the polytope as the most probable states of the algorithm.

We consider the problem of predicting power outages in an electrical power grid due to hazards produced by convective storms. These storms produce extreme weather phenomena such as intense wind, tornadoes and lightning over a small area. In this paper, we discuss the application of state-of-the-art machine learning techniques, such as random forest classifiers and deep neural networks, to predict the amount of damage caused by storms.

The analysis of large datasets is often complicated by the presence of missing entries, mainly because most of the current machine learning algorithms are designed to work with full data. The main focus of this work is to introduce a clustering

To leverage the spatial relationship of lattice data, such as images, we introduce total variational (TV) regularization into support vector machines (SVM), called TV-SVM. TV-SVM encourages local smoothness and sparsity in gradient domain of the learned parameters. TV-SVM is optimized via the alternating direction method of multipliers (ADMM) algorithm and is significantly better than (Linear) SVM for image classifications.

To leverage the spatial relationship of lattice data, such as images, we introduce total variational (TV) regularization into support vector machines (SVM), called TV-SVM. TV-SVM encourages local smoothness and sparsity in gradient domain of the learned parameters. TV-SVM is optimized via the alternating direction method of multipliers (ADMM) algorithm and is significantly better than (Linear) SVM for image classifications.

To leverage the spatial relationship of lattice data, such as images, we introduce total variational (TV) regularization into support vector machines (SVM), called TV-SVM. TV-SVM encourages local smoothness and sparsity in gradient domain of the learned parameters. TV-SVM is optimized via the alternating direction method of multipliers (ADMM) algorithm and is significantly better than (Linear) SVM for image classifications.