Create a Sudoku Solver in Java - Full Tutorial
Learn to build a Java program that solves Sudoku puzzles. This tutorial breaks down the logic and implementation, offering hands-on coding experience to enhance your Java skills.
Battlesnake: Coding Your Own AI Snake Game
Explore Battlesnake, an evolved version of the classic snake game. Code your own AI-powered snake and compete in this exciting programming challenge.
Advanced Java Stream API Techniques - JetBrains Technology Day
Explore advanced Stream API tasks in Java, uncovering mysteries and solving complex scenarios beyond simple use cases. Gain insights into leveraging this powerful feature effectively.
Leveraging Java 17 Features to Create a Wordle Checker
Learn to build a Wordle Checker using Java 17's new features like Records, Switch Expressions, and Pattern Matching. Improve code readability while implementing complex algorithms.
AFLOW: Automating Agentic Workflows for Large Language Models
Discover how AFLOW framework optimizes LLM workflows through automated code-based representations, specialized Monte Carlo Tree Search, and reusable operators to enhance AI performance while reducing computational costs.
Applications of Algebraic Complexity to Unsupervised Learning
Delve into advanced algebraic complexity theory and its applications in unsupervised learning algorithms, exploring computational hardness of multivariate polynomials and efficient learning techniques.
Innovations in Theoretical Computer Science 2020 - Session 6
Explore cutting-edge research in theoretical computer science, including scheduling algorithms, online computation, network coordination games, tournament rules, and prophet inequalities.
A Smoothed Analysis of the Greedy Algorithm for Linear Contextual Bandits - Theory Seminar
Explore smoothed analysis of greedy algorithms in bandit learning, addressing fairness concerns in decision-making while achieving "no regret" performance in slightly perturbed environments.
Mamba: Linear-Time Sequence Modeling with Selective State Spaces
Explore Mamba, a novel linear-time sequence modeling architecture using selective state spaces. Learn about its advantages over Transformers and its applications in language, audio, and genomics.
Explainable Program Synthesis by Localizing Specifications
Explore explainable program synthesis through subspecifications, enhancing implementation understanding with logical formulas. Learn algorithms for constructing and verifying subspecifications, their properties, and impact on code comprehension.
DQN - Playing Atari with Deep Reinforcement Learning - RL Paper Explained
Explore deep reinforcement learning with DQN, covering experience replay, MDP formalism, function approximators, and its application to Atari games. Gain insights into RL challenges and solutions.
Nyströmformer- A Nyström-Based Algorithm for Approximating Self-Attention
Explore Nyströmformer, a novel algorithm for approximating self-attention in Transformers with linear complexity, enabling processing of longer sequences and improving scalability in natural language tasks.
Continuous Algorithms - Sampling and Optimization in High Dimension
Explore high-dimensional sampling and optimization techniques, including cutting plane methods, interior-point algorithms, and Riemannian Hamiltonian Monte Carlo, with insights on complexity and open problems.
V-Learning - Simple, Efficient, Decentralized Algorithm for Multiagent RL
Explore efficient decentralized algorithms for multiagent reinforcement learning, focusing on V-learning's ability to overcome challenges in joint action spaces and achieve Nash equilibria.
Neural Nets for NLP 2021 - Building A Neural Network Toolkit for NLP
Implement a minimal neural network toolkit for NLP, covering model definition, graph creation, forward/backward calculation, and parameter updates.
Neural Nets for NLP 2020 - Search-Based Structured Prediction
Learn search-based structured prediction techniques for NLP, including structured perceptron, max-margin objectives, and exposure bias remedies. Explore global models and cost-augmented training for improved sequence prediction.
Cycle Sort - Interview Questions for Amazon, Google, Microsoft
Master cyclic sort algorithm and solve LeetCode problems from easy to hard, enhancing your skills for top tech company interviews. Comprehensive tutorial with step-by-step explanations and practical coding examples.
Dynamic Matching - Rounding & Sparsification and New Tools
Explore dynamic matching algorithms, focusing on rounding and sparsification techniques. Learn about new algorithmic primitives for fast static algorithms and their applications in dynamic graph theory.
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds
Explore sublinear time algorithms for estimating maximum matching size in graphs, their applications in dynamic graphs, and recent advancements in the field.
Dynamic Graph Algorithms - What We Know and What We Don't - Richard M. Karp Distinguished Lecture
Explore dynamic graph algorithms, their applications, and recent breakthroughs. Learn about current research, techniques, and open questions in this critical field of computer science.
Parallelism in Dynamic Graph Algorithms
Explore parallelism in dynamic data structures through batch algorithms and graph streaming, enabling efficient handling of concurrent updates and queries in graph algorithms.