計算量理論入門 - 時間と空間の制限 - 第3回
Dive into 計算量理論 through an exploration of computational complexity, polynomial time and space constraints, string rewriting problems, and complexity hierarchies in this mathematical lecture from Kyoto University.
計算量理論入門 - 問題と機械 - 第1回
Dive into computational complexity theory through fundamental concepts of finite state machines, Turing machines, and the Church-Turing thesis, exploring how to measure and understand mathematical complexity.
The Best Multicore-Parallelization Refactoring You've Never Heard Of
Discover a powerful, lesser-known refactoring technique for optimizing multicore parallelization in software development.
FP² - Fully in-Place Functional Programming
Explore a novel approach to functional programming that enables efficient in-place updates without sacrificing purity. Learn about the FIP calculus and its implementation in the Koka language.
More Fixpoints - Solving Recursive Problems in Haskell
Explore innovative solutions for recursive Haskell programming, overcoming limitations and enabling elegant, productive code using pure data structures with enhanced fixpoint capabilities.
Artificial Languages are Dead. Long Live Artificial Languages - SLE23
Explore the impact of Large Language Models on programming, artificial languages, and CS education in this thought-provoking talk by Crista Lopes.
Witter: A Library for White-Box Testing of Introductory Programming Algorithms
Explore Witter, a library for white-box testing in programming education. Analyze method execution against reference solutions to verify algorithm behavior and provide insightful feedback.
Why Design Your Own Levels When Your Computer Can Do It? - Procedural Level Generation in Video Games
Explore procedural level generation in video games, covering WebGL graphics, algorithms, and ClojureScript implementation for innovative game design.
Introduction to C++ Containers - Know Your Data Structures
Explore C++ Standard Library containers, their organization, trade-offs, and usage. Gain insights into data structure selection, time complexity, and new C++23 features.
Performance Matters: New Tricks for Old Dogs - Lecture 1
Explore performance-oriented C++ techniques, including faster erasure methods, cache-friendly linked lists, and efficient random-access containers. Suitable for both newcomers and experienced developers.
Advanced SIMD Algorithms in Pictures
Explore non-trivial SIMD algorithms like strcmp, set_intersect, and sort through visual explanations. Demystify vectorized algorithms for those with basic CS knowledge.
Quantum-Inspired Annealing: The State of Play
Explore quantum-inspired annealing's current state, comparing quantum and classical approaches, and examining benchmarks for various optimization problems.
Inferring Parsimonious Migration Histories for Metastatic Cancers
Explore computational methods for inferring cancer metastasis patterns, focusing on parsimonious migration histories and multi-strain infections in tumor evolution.
Exploiting Citation Networks in Large Corpora to Improve Relevance on Broad Queries
Discover how to leverage citation networks in large legal databases to improve search relevance for broad queries, enhancing user experience and document ranking accuracy.
Creating Representative Query Sets for Offline Evaluation
Learn to construct representative query sets for offline evaluation in AI/ML experimentation, enhancing understanding of algorithm impacts and streamlining A/B testing processes.
Reciprocal Rank Fusion (RRF) - How to Stop Worrying about Boosting - Lecture
Explore Reciprocal Rank Fusion (RRF) for combining search results, its advantages over boosting, and implementation in various systems. Learn from Philipp Krenn's expertise in search technology.
Shedding Light on Positional Bias: Strategies for Mitigation in Search Ranking - Haystack EU 2023
Explore strategies to mitigate positional bias in search rankings, improving relevance and fairness in ML-based systems for better user experience and search quality.
Beyond the Known: Exploratory and Diversity Search with Vector Embeddings - Haystack EU 2023
Explore innovative strategies for exploratory and diverse search using vector embeddings, enhancing user experiences beyond traditional search paradigms.
Networks and Recommendation Systems
Explore graph-based recommendation systems, their transparent implementation, and real-world applications in this technical deep dive for data science practitioners.
Multi-Precision Optimization Algorithm: Decreasing Computational Cost and Controlling Computational Error
Explore multi-precision optimization algorithms to reduce computational costs and control errors in smooth, non-convex function minimization, with applications in deep neural network training.
Global Convergence and Asymptotic Optimality of the Heavy Ball Method
Explore global convergence and asymptotic optimality of the heavy ball method, challenging complexity lower bounds for strongly convex functions with Lipschitz gradients.