CMU Neural Nets for NLP 2017 - Advanced Search Algorithms
Explore advanced search algorithms for NLP, including beam search and A*-type search, with a focus on their applications, benefits, and challenges in neural network-based language processing.
Neural Nets for NLP 2020: Conditioned Generation
Learn about encoder-decoder models, conditional generation, search techniques, and evaluation methods for neural networks in natural language processing.
Neural Nets for NLP 2020: Advanced Search Algorithms
Explore advanced search algorithms for NLP, including beam search, minimum Bayes risk, and sampling-based methods. Learn to address search errors and model errors in neural networks.
M-way Trees and M-way Search Trees - Comparison with Binary Search Trees
Explore M-way trees and M-way search data structures, comparing them to binary search trees. Learn their structure, benefits, and applications in data organization and retrieval.
Neural Nets for NLP 2021 - Conditioned Generation
Explore encoder-decoder models, conditional generation, search techniques, ensembling, evaluation methods, and various data types for conditioning in neural network-based natural language processing.
Coding Adventure - Making a Stronger Chess Engine
Explore techniques to enhance a chess engine, including move selection, search extensions, bitboards, and optimization, culminating in the creation of a Lichess bot and performance analysis.
Array of Objects Algorithms - Search, Sort, Reverse, Max, Min, Custom Methods
Learn essential array operations: searching, sorting, reversing, and finding min/max elements. Master custom comparison methods and best practices for efficient array manipulation in object-oriented programming.
Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
Explore quantum walks on Johnson graphs for spatial search, covering setup, strategies, and analysis of search algorithms and success probabilities.
Frequently Bought Together Recommendations Using Embeddings - Challenges and Solutions
Explore embedding-based "frequently bought together" recommendations for e-commerce, covering model training, productionization, metrics, and serving strategies. Learn practical tips for large-scale implementation.
A* Star Search Algorithm in Game Programming - Episode 100
Learn to implement the A* search algorithm for efficient pathfinding in game development. Gain practical skills to optimize your game's AI and navigation systems.
Searching an Element in Binary Search Tree - Data Structures
Learn efficient element searching in Binary Search Trees (BST) through key comparisons with the root node, navigating left or right subtrees based on value relationships.
Toward Probabilistic Coarse-to-Fine Program Synthesis
Explore probabilistic coarse-to-fine program synthesis, a novel approach using iterative refinement of stochastic programs to efficiently search and generate programs matching specifications.
Reasoning About Performance - In the Context of Search
Explore performance estimation for search engines using back-of-the-envelope calculations. Learn about core algorithms, practical considerations, and the surprising effectiveness of "obsolete" technologies in modern search.
PET - Optimizing Tensor Programs with Partially Equivalent Transformations and Automated Corrections
Optimizing tensor programs with partially equivalent transformations, improving DNN efficiency by up to 2.5×. Introduces PET framework for automated corrections and theoretical foundations for equivalence examination.
99 Problems, But The Search Ain't One
Explore advanced search techniques and problem-solving strategies for PHP developers, focusing on efficient algorithms and data structures to optimize search functionality.
The Audacious Array
Explore Ruby's versatile array capabilities, from basic operations to advanced techniques like randomization, 2D mapping, and set operations, enhancing your ability to write elegant, efficient code.
In-Memory Database with Indices from Scratch
Learn to build a simple, extensible in-memory database with indices using C++'s standard library. Explore search algorithms and data structures through animations.
Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity
Explore advanced cryptographic techniques for efficient and secure searchable encryption, focusing on worst-case sub-linear complexity and innovative data structures.
Winning Card Games with 1000+ CPUs
Explore how AWS Lambda and Python concurrency can optimize a genetic algorithm for winning the SushiGo card game, discussing implementation, challenges, and results.
Defining a Search Problem in AI
Explore classic AI search algorithms, from uninformed to advanced techniques, with insights on problem-solving strategies and heuristic development.
Thinking of Topic Modeling as Search in Real-time Applications
Explore how treating topic modeling as a search problem can enhance real-time applications and overcome common challenges in document classification and clustering.