Search Results

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact ...

• An inexact adaptive and provably convergent semismooth Newton method is introduced.
• Rigorous convergence of this method in function spaces is established.
• The source of efficiency and inexactness is the randomized matrix sketching.

Massive Online Open Course (MOOC) platforms are considered a distinctive way to deliver a modern educational experience, open to a worldwide public. However, student engagement in MOOCs is a less explored area, although it is known that MOOCs ...

Dynamic Time Warping (DTW) coupled with k Nearest Neighbour classification, where $k=1$, is the most common classification algorithm in time series analysis. The fact that the complexity of DTW is quadratic, and therefore computationally expensive, ...

k Nearest Neighbour classification techniques, where , coupled with Dynamic Time Warping (DTW) are the most effective and most frequently used approaches for time series classification. However, because of the quadratic complexity of DTW, research ...

Many governments around the world aim seriously to make their services available online and deliver it to their citizens in professional and secure manner. E-government services aims to improve and facilitate the communication between government and ...