Maximum Subarray Problem

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (40)

Optimization algorithms Log in to Mediaspace to watch this video

Covers optimization algorithms, focusing on Proximal Gradient Descent and its variations.

Reliable Broadcast: Overview and Algorithms Log in to Mediaspace to watch this video

Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.

Linear Programming: Solving LPs Log in to Mediaspace to watch this video

Covers the process of solving Linear Programs (LPs) using the simplex method.

Introduction to Logarithm Log in to Mediaspace to watch this video

Covers the introduction to logarithms, algorithmic notations, and analysis of algorithm travel times.

Numerical Analysis: Course Overview Log in to Mediaspace to watch this video

Provides an overview of the Numerical Analysis course at EPFL, focusing on course organization, materials, and learning outcomes.

Variance Reduction: Strategies and Applications Log in to Mediaspace to watch this video

Discusses variance reduction techniques in stochastic simulation, focusing on allocation strategies and replica generation algorithms.

Introduction to Algorithms Log in to Mediaspace to watch this video

Covers the concept of algorithms, loop invariants, and examples of algorithmic problem-solving.

Introduction to Optimization Log in to Mediaspace to watch this video

Introduces linear algebra, calculus, and optimization basics in Euclidean spaces, emphasizing the power of optimization as a modeling tool.

Causal Broadcast: Understanding Ordering of Messages Log in to Mediaspace to watch this video

Covers causal broadcast, ensuring messages are delivered in a causal order using algorithms and reliable broadcast.

Online Matching in Evolving Environments Log in to Mediaspace to watch this video

Explores online matching in evolving environments, addressing challenges and solutions for adapting algorithms to changing data.

Dynamic Programming: Knapsack Log in to Mediaspace to watch this video

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Flow Networks: Strongly Connected Components Log in to Mediaspace to watch this video

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.

Scientific Machine Learning: Applications and Algorithms Log in to Mediaspace to watch this video

Explores scientific machine learning applications, challenges with sparse data, and physics-inspired algorithms to improve spectral methods.

Markov Chains: Reversibility & Convergence Log in to Mediaspace to watch this video

Covers Markov chains, focusing on reversibility, convergence, ergodicity, and applications.

Graph Sketching: Connected Components Log in to Mediaspace to watch this video

Covers the concept of graph sketching with a focus on connected components.

Navier-Stokes: SIMPLE Algorithm Log in to Mediaspace to watch this video

Explores the application of the SIMPLE algorithm in solving Navier-Stokes equations and compares staggered grid vs. collocated grid approaches in numerical flow simulations.

Compilation and C++ Basics Log in to Mediaspace to watch this video

Covers the basics of compilation and C++ programming, including variables, functions, loops, and debugging.

Distributed Information Systems: Overview and Course Information Log in to Mediaspace to watch this video

Covers key concepts of Distributed Information Systems and course logistics.

Euclidean Algorithm: GCD Calculation Log in to Mediaspace to watch this video

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

The Black-Scholes-Merton Model Log in to Mediaspace to watch this video

Covers the Black-Scholes-Merton model, dynamics, self-financing strategies, and the PDE.

Page 2 of 2