50分で学ぶアルゴリズム / Algorithms in 50 minutes
本スライドでは、有名なアルゴリズムを概観し、アルゴリズムに興味を持っていただくことを目標にします。 第 1 部：アルゴリズムとは 第 2 部：学年を当ててみよう 第 3 部：代表的なアルゴリズム問題 第 4 部：コンピュータとアルゴリズム
タグ検索の該当結果が少ないため、タイトル検索結果を表示しています。
本スライドでは、有名なアルゴリズムを概観し、アルゴリズムに興味を持っていただくことを目標にします。 第 1 部：アルゴリズムとは 第 2 部：学年を当ててみよう 第 3 部：代表的なアルゴリズム問題 第 4 部：コンピュータとアルゴリズム
AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms
New AI agent evolves algorithms for math and practical applications in computing by combining the creativity of large language models with automated evaluators
Disclaimer: There are lies, damn lies, and benchmarks from some random person on the internet. If you are considering taking some of the advice in this post please remember to test your specific workloads, which might have different bottlenecks. Also the implementation quality in your particular software stack for your particular hardware matters a lot. For this post I’ll be playing with a ~5 GiB
Design advanced algorithms for math and applications in computing
This is an upcoming high performance computing book titled “Algorithms for Modern Hardware” by Sergey Slotin. Its intended audience is everyone from performance engineers and practical algorithm researchers to undergraduate computer science students who have just finished an advanced algorithms course and want to learn more practical ways to speed up a program than by going from $O(n \log n)$ to $
Challenging algorithms and data structures every programmer should try
Challenging algorithms and data structures every programmer should try 12/21/2022 See the discussion of this post on Reddit and Hacker News. Alright, so we are all spending our leisure time reading about algorithms, right? Well, back when I was a student, my algorithms courses regularly put me to sleep. This is unfortunate because there are some really interesting algorithms and data structures ou
Learning the fundamentals shouldn't be a chore. This one-of-a-kind interactive book offers a hands-on approach to learning data structures and algorithms, featuring rich visualizations, code execution playback, an assortment of problems and an embedded Python environment. It’s designed to support both beginners and more experienced learners through active exploration and interactivity. Purchase $3
Faster sorting algorithms discovered using deep reinforcement learning - Nature
Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Design advanced algorithms for math and applications in computing
12.6. B-Trees — CS3 Data Structures & Algorithms
12.6. B-Trees¶ 12.6.1. B-Trees¶ This module presents the B-tree. B-trees are usually attributed to R. Bayer and E. McCreight who described the B-tree in a 1972 paper. By 1979, B-trees had replaced virtually all large-file access methods other than hashing. B-trees, or some variant of B-trees, are the standard file organization for applications requiring insertion, deletion, and key range searches.
New – Additional Checksum Algorithms for Amazon S3 | Amazon Web Services
AWS News Blog New – Additional Checksum Algorithms for Amazon S3 Amazon Simple Storage Service (Amazon S3) is designed to provide 99.999999999% (11 9s) of durability for your objects and for the metadata associated with your objects. You can rest assured that S3 stores exactly what you PUT, and returns exactly what is stored when you GET. In order to make sure that the object is transmitted back-a
Discovering faster matrix multiplication algorithms with reinforcement learning - Nature
We focus on the fundamental task of matrix multiplication, and use deep reinforcement learning (DRL) to search for provably correct and efficient matrix multiplication algorithms. This algorithm discovery process is particularly amenable to automation because a rich space of matrix multiplication algorithms can be formalized as low-rank decompositions of a specific three-dimensional (3D) tensor2,
Understanding Layout Algorithms The mental model shift that makes CSS more intuitive Filed underCSSoninMarch 28th, 2022.Mar 2022.Last updatedoninJanuary 28th, 2025.Jan 2025. A few years ago, I had a Eureka! moment with CSS. Up until that moment, I had been learning CSS by focusing on the properties and values we write, things like z-index: 10 or justify-content: center. I figured that if I underst
This document aims to be a self-contained, mathematically precise overview of transformer architectures and algorithms (*not* results). It covers what transformers are, how they are trained, what they are used for, their key architectural components, and a preview of the most prominent models. The reader is assumed to be familiar with basic ML terminology and simpler neural network architectures s
Diff Algorithms - flo.znkr.io
Posted on September 30, 2025 Updated on October 8, 2025 For software engineers, diffs are a ubiquitous method for representing changes: We use diffs to compare different versions of the same file (e.g., during code review or when trying to understand the history of a file), to visualize the difference of a failing test compared with its expectation, or to apply changes to source files automaticall
GitHub - ptyadana/Data-Science-and-Machine-Learning-Projects-Dojo: collections of data science, machine learning and data visualization projects with pandas, sklearn, matplotlib, tensorflow2, Keras, various ML algorithms like random forest classifier, boo
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
Grouping Similar Articles with Search Engine More-Like-This Queries and Graph Algorithms
Grouping Similar Articles with Search Engine More-Like-This Queries and Graph Algorithms
GitHub - lucidrains/lion-pytorch: 🦁 Lion, new optimizer discovered by Google Brain using genetic algorithms that is purportedly better than Adam(w), in Pytorch
🦁 Lion, EvoLved Sign Momentum, new optimizer discovered by Google Brain that is purportedly better than Adam(w), in Pytorch. This is nearly a straight copy from here, with few minor modifications. It is so simple, we may as well get it accessible and used asap by everyone to train some great models, if it really works 🤞 Learning rate and weight decay: the authors write in Section 5 - Based on ou
Tesla odometer uses “predictive algorithms” to void warranty, lawsuit claims
Tesla is facing a new scandal that once again sees the electric automaker accused of misleading customers. In the past, it has been caught making “misleading statements” about the safety of its electric vehicles, and more recently, an investigation by Reuters found Tesla EVs exaggerated their efficiency. Now, a lawsuit filed in California alleges that the cars are also falsely exaggerating odomete
First one I checked was `two_sum.rs` and it uses a `HashMap`: https://github.com/TheAlgorithms/Rust/blob/master/src/genera...Surely the best way is to sort the numbers and then walk from both ends? Nice work anyway! Eww, eww, eww, why is that returning Vec<i32>? It should clearly be returning Option<(usize, usize)>. pub fn two_sum(nums: Vec<i32>, target: i32) -> Option<(usize, usize)> { let mut ha
GitHub - davidesantangelo/krep: Fast text search tool with advanced algorithms, SIMD acceleration, multi-threading, and regex support. Designed for rapid, large-scale pattern matching with memory-mapped I/O and hardware optimizations.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
The purpose of this article is to explain techiques that enabled me to make simulations like the one below, along with a lot of other organic looking things. We will focus on algorithmic techniques for artistic purpose rather than scientific meaning. 1. Physarum algorithm from Jeff Jones (2010) Jeff Jones presented a simulation algorithm that reproduces the behavior of organisms such as Physarum p
はじめに テキスト生成モデルをAPIサーバでホストする需要が増えてきている昨今ですが1サーバでできるだけ多くのリクエストをさばくためにはどうすればよいでしょうか？もちろん高速なツールを使うことも重要ですが、それだけでは限界があります。前回の記事ではいくつかのツールを比較しましたが、どのツールでもバッチサイズを上げることで単位時間あたりの処理能力を高めることができるということがわかりました。つまりAPIサーバ側でバッチサイズを大きくする工夫をすることでより多くのリクエストをさばくことが可能になります。 今回の記事ではText Generation InferenceやvLLMなどが採用して注目を集めているContinuous batchingと呼ばれる手法について紹介します。 名称や仕組みなどについてはこれらの解説を参考にしています。 予備知識 Continuous batchingの説明に
C++20’s Ranges offer alternatives for most of <algorithm>'s'. This time I’d like to show you ten non-modifying operations. We’ll compare them with the “old” standard version and see their benefits and limitations. Let’s go. Before we start Key observations for std::ranges algorithms: Ranges algorithms are defined in the <algorithm> header, while the ranges infrastructure and core types are defined
MTV REWIND - 33,000+ Music Videos • Zero Ads • Zero Algorithms
Love the Project? Click to buy me a Coffee ☕ ☕ Support This Project Free forever. No ads. Help keep it alive! 💛
GitHub - Avaiga/taipy: Turns Data and AI algorithms into production-ready web applications in no time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
We present a method to formulate algorithm discovery as program search, and apply it to discover optimization algorithms for deep neural network training. We leverage efficient search techniques to explore an infinite and sparse program space. To bridge the large generalization gap between proxy and target tasks, we also introduce program selection and simplification strategies. Our method discove
本スライドでは、有名なアルゴリズムを概観し、アルゴリズムに興味を持っていただくことを目標にします。 第 1 部：アルゴリズムとは 第 2 部：学年を当ててみよう 第 3 部：代表的なアルゴリズム問題 第 4 部：コンピュータとアルゴリズム
NIST Announces First Four Quantum-Resistant Cryptographic Algorithms
GAITHERSBURG, Md. — The U.S. Department of Commerce’s National Institute of Standards and Technology (NIST) has chosen the first group of encryption tools that are designed to withstand the assault of a future quantum computer, which could potentially crack the security used to protect privacy in the digital systems we rely on every day — such as online banking and email software. The four selecte
Data Science: Theories, Models, Algorithms, and Analytics
Data Science: Theories, Models, Algorithms, and Analytics Sanjiv Ranjan Das 2017-2020 Preface I developed these class notes for my Machine Learning with R course. It traces my evolution as a data scientist into redundancy, I expect I will be replaced by a machine soon! There is a lot of work remaining to be done on this, including adding many more citations, replacing figures, and making sure full
AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms
New AI agent evolves algorithms for math and practical applications in computing by combining the creativity of large language models with automated evaluators
Welcome to Lesson 5 of 12 in our free course series, LLM Twin: Building Your Production-Ready AI Replica. You’ll learn how to use LLMs, vector DVs, and LLMOps best practices to design, train, and deploy a production ready “LLM twin” of yourself. This AI character will write like you, incorporating your style, personality, and voice into an LLM. For a full overview of course objectives and prerequi
GitHub - deepseek-ai/DeepSpec: DeepSpec: a full-stack codebase for training and evaluating speculative decoding algorithms
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
GitHub - SeldonIO/alibi-detect: Algorithms for outlier, adversarial and drift detection
Alibi Detect is a source-available Python library focused on outlier, adversarial and drift detection. The package aims to cover both online and offline detectors for tabular data, text, images and time series. Both TensorFlow and PyTorch backends are supported for drift detection. Documentation For more background on the importance of monitoring outliers and distributions in a production setting,
How The New York Times incorporates editorial judgment in algorithms to curate its home page
How The New York Times incorporates editorial judgment in algorithms to curate its home page The Times’ algorithmic recommendations team on responding to reader feedback, newsroom concerns, and technical hurdles. Whether on the web or the app, the home page of The New York Times is a crucial gateway, setting the stage for readers’ experiences and guiding them to the most important news of the day.
As part of Swift’s move toward safe, simple, and performant asynchronous programming, we are pleased to introduce a new package of algorithms for AsyncSequence. It is called Swift Async Algorithms and it is available now on GitHub. This package has three main goals: First-class integration with async/await Provide a home for time-based algorithms Be cross-platform and open source Motivation AsyncA
Introduction Popular programming languages provide methods or functions which locate a substring in a given string. In C it is the function strstr, the C++ class std::string has the method find, Python's string has methods pos and index, and so on, so forth. All these APIs were designed for one-shot searches. During past decades several algorithms to solve this problem were designed, an excellent
Posted by Leonardo Galler and Matteo Kimura on April 21, 2019 What are Sorting Algorithms? Sorting algorithms are ways to organize an array of items from smallest to largest. These algorithms can be used to organize messy data and make it easier to use. Furthermore, having an understanding of these algorithms and how they work is fundamental for a strong understanding of Computer Science which is
For Algorithms, a Little Memory Outweighs a Lot of Time | Quanta Magazine
One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling discovery about the relationship between time and memory in computing. It was a rough sketch of a mathematical proof that memory was more powerful than computer scientists believed: A small amount would be as helpful as a lot of time in all conceivable computations. That
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Use Fast Data Algorithms | Joey Lynch's Site
AlphaDev discovers faster sorting algorithms
Algorithms for Modern Hardware - Algorithmica
The Interactive Handbook on Data Structures and Algorithms
Discovering novel algorithms with AlphaTensor
Understanding Layout Algorithms • Josh W. Comeau
Formal Algorithms for Transformers
All Algorithms Implemented in Rust | Hacker News
Algorithms for making interesting organic simulations
テキスト生成APIサーバのスループットを高めるbatching algorithms
C++20 Ranges Algorithms - 7 Non-modifying Operations
Symbolic Discovery of Optimization Algorithms
50分で学ぶアルゴリズム / Algorithms in 50 minutes
The 4 Advanced RAG Algorithms You Must Know to Implement
Introducing Swift Async Algorithms
SIMD-friendly algorithms for substring searching
Sorting Algorithms - LAMFO
Amazon.co.jp: 大規模データセットのためのアルゴリズムとデータ構造 (Compass Algorithms): Dzejla Medjedovic (著), Emin Tahirovic (著), Ines Dedovic (著), 岡田佑一 (翻訳): 本
auto-moto-picks.hatenablog.com
dc.watch.impress.co.jp
www.sankei.com
projectofnapskint.com
www.jiji.com
zenn.dev/edom18