Everything tagged algorithm, newest first. Tags come from the classifier reading each item's summary; 394 tags used 25 times or more have their own page.
This crash course demystifies data structures and algorithms by using real-world analogies to build intuitive understanding without coding, making complex computer science concepts accessible and relatable.
A security researcher developed an algorithm that generates patterns to conceal people, faces, and vehicles from surveillance cameras.
Human moderation is essential to ensure fairness, accuracy, and empathy in decision-making processes, preventing biases and errors that automated systems might overlook.
In 1956, Edsger W. Dijkstra, a Dutch programmer, developed a groundbreaking algorithm in 20 minutes that revolutionized fields like GPS navigation and network routing, all without using pencil and paper.
Dr. Bruce Davie discusses a new algorithm that potentially surpasses Dijkstra's in efficiency for shortest path calculations in link state routing protocols.
The sliding window algorithm is a crucial technique for optimizing array or string problems by reducing nested loops to a single pass, and this course by ex-Google engineer Alvin aims to teach it through practical problem-solving, gradually increasing in difficulty to prepare for technical interviews.
The article discusses the complexities and innovations in developing a multimodal video search engine, emphasizing the integration of specialized models to process vast amounts of video data efficiently for real-time, context-aware search capabilities.
The P versus NP problem, a major unsolved question in computer science, explores whether problems that can be quickly verified can also be quickly solved, with significant implications for cryptography and optimization.
Bruce Davie's article critiques the push for faster-than-Dijkstra algorithms in link-state routing, highlighting that Dijkstra's algorithm efficiently handles large networks, as demonstrated by its performance on a 2000-node network in 2003.
The Free Code Camp podcast, hosted by Quincy Larson, features an interview with software engineer Tapus Adikari, highlights new Free Code Camp courses on Python and JavaScript, and offers a course on building a horror game using Unreal Engine 5, while also sharing community news and music recommendations.
This course, created by Sheldon, teaches dynamic programming through visual animations and step-by-step explanations, focusing on mastering key patterns to solve complex algorithmic problems efficiently without memorizing numerous problems.
AI, like coffee and fitness, has evolved with complex terminologies and techniques such as machine learning, deep learning, and natural language processing, requiring developers to stay updated to effectively build models and solve problems.
Google's stance on AI-generated content is nuanced, as it embraces AI advancements but remains cautious about content quality and authenticity.
Businesses implementing personalized pricing must inform customers that the price is determined by an algorithm using their personal data.
The discussion explores memorization in programming through a stair-climbing problem, highlighting its relation to the Fibonacci sequence and demonstrating recursive problem-solving techniques.
Dr. Radu's JavaScript course at Caria University teaches problem-solving using first principles, focusing on vision-based positioning systems, with step-by-step algorithm implementation and practical exercises for beginners.
This comprehensive 50-hour course by Parth from Destination Fang aims to demystify technical interviews for software engineering roles by teaching essential data structures, algorithms, and problem-solving skills, preparing participants to tackle a wide range of interview questions confidently.
Cardinality estimation involves using techniques like hashing and algorithms such as HyperLogLog to efficiently estimate the number of unique users accessing a website, minimizing memory usage compared to storing all unique IP addresses.
AI assistants lack inherent personalities, instead producing outputs shaped by human programming and interaction patterns.
SIEVE is a newly introduced algorithm that surpasses the traditional LRU in terms of efficiency and scalability for managing web cache workloads.
This course, developed by Sheldon Chai, provides a detailed exploration of essential data structures and algorithms, focusing on practical applications, efficiency, and avoiding brute force solutions, with step-by-step examples and interview problem walkthroughs.
X aims to create an open source algorithm using feedback to identify posts favored by individuals with diverse viewpoints.
Sam Elman discusses OpenAI's evolution and future, emphasizing personalized AI integration, potential breakthroughs, and the pivotal role of AI agents in upcoming years.
The video explores foundational and advanced data structures, such as B trees, radix trees, ropes, Bloom filters, and cuckoo hashing, highlighting their unique functionalities and efficiencies in solving complex programming problems.
A quiz highlights the difference in finding a special input in a function using classical versus quantum computing, emphasizing that quantum methods can significantly reduce the number of trials needed.
The problem of determining the shortest path between two points in a Cartesian plane with two possible paths involves calculating and comparing sums of square roots, which is surprisingly complex and potentially as hard as the SAT problem.
Simulated annealing is an effective algorithmic approach for efficiently solving complex scheduling problems by mimicking the cooling process of metals to find optimal solutions.
The X algorithm will integrate community notes across Facebook, Instagram, and Threads, enhancing cross-platform collaboration and information sharing.
Rola Dolly's introductory machine learning course covers fundamentals, models, generative AI, and AI system architecture, designed for beginners with no prior knowledge, led by an experienced AI engineer and AWS enthusiast.
This guide offers a comprehensive overview of essential programming concepts for Cambridge A-level Computer Science, focusing on VB.NET implementations from basic algorithms to advanced object-oriented programming and abstract data types.
Quicksort, a fast and simple algorithm invented by Tony Hoare in 1959, sorts lists by selecting a pivot and recursively sorting sublists, demonstrated here with a nine-number example.
The discussion introduces Markov Decision Processes (MDPs) as a modeling tool for decision-making under uncertainty and explains how the value iteration algorithm can be used to derive action decisions from these processes.
AI-generated videos often exhibit nonsensical movements due to limitations in current technology and algorithms, as demonstrated by OpenAI's Sora.
Meta's large-scale cryptographic monitoring enhances understanding, detection, and removal of weak algorithms, improving change safety and reliability in cryptography usage.
Two algorithms have been added, with plans for two more in the upcoming months.
TikTok is facing legal claims due to its For You Page algorithm allegedly recommending harmful content that resulted in children's deaths.
Landlords are utilizing the RealPage algorithm to standardize and optimize their rental pricing strategies.
Haunted by glitching algorithms, self-driving cars are causing disturbances in San Francisco.
Dave Plummer, a retired Microsoft engineer, races prime-solving algorithms on various computers, including a PDP 1134 and a modern Thread Ripper.
The discussion revolves around favorite computer science and general books, emphasizing the impact of certain texts on personal and professional interests, with a focus on algorithms, cryptography, and spy novels.
