Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis, recursion equations, estimation methods, elementary combinatorial arguments.

In this module the student will learn the very basics of algorithms through three examples: insertion sort (sort an array in ascending/descending order); binary search: search whether an element is ...

This paper presents convergence analysis of some algorithms for solving systems of nonlinear equations defined by locally Lipschitzian functions. For the directional derivative-based and the ...

Do you want to enter the job market as a competitive GIS modeler with programming skills? This course will help you get there. It focuses on the extension of geographic information systems (GIS) ...

We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is ...