article thumbnail

SIMD-friendly algorithms for substring searching (2016)

Hacker News

SIMD-friendly algorithms for substring searching Author: Wojciech Muła Added on: 2016-11-28 Updated on: 2018-02-14 (spelling), 2017-04-29 (ARMv8 results) Introduction Popular programming languages provide methods or functions which locate a substring in a given string. All these APIs were designed for one-shot searches.

article thumbnail

Q-learning is not yet scalable

Hacker News

In 2016, RL achieved superhuman-level performance in games like Go and Chess. However, there is one important caveat: most of the current real-world successes of RL have been achieved with on-policy RL algorithms ( e.g. , REINFORCE, PPO, GRPO, etc.), Q-learning is the most widely used off-policy RL algorithm. This is great.

Algorithm 172
professionals

Sign Up for our Newsletter

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

article thumbnail

Scaling de-duplication in WorldCat: Balancing AI innovation with cataloging care | OCLC

Flipboard

The fundamental shift in de-duplication Historically, de-duplication has relied on deterministic algorithms and manual effort on the part of catalogers and OCLC staff. While effective, these methods have limits. and its affiliates Privacy statement Cookie notice Cookie settings Accessibility statement ISO 27001 Certificate

AI 131
article thumbnail

Foundations of Computer Vision

Hacker News

For a number of years, we taught our computer vision class from the Computer Vision: A Modern Approach [ 1 ] , and have also used Rick Szeliski’s book, Computer Vision: Algorithms and Applications [ 2 ]. Szeliski, Computer vision algorithms and applications., MacKay, Information theory, inference and learning algorithms.,

article thumbnail

Benchmarking Amazon Nova and GPT-4o models with FloTorch

AWS Machine Learning Blog

simple_w_condition Movie In 2016, which movie was distinguished for its visual effects at the oscars? The goal is to index these five webpages dynamically using a common embedding algorithm and then use a retrieval (and reranking) strategy to retrieve chunks of data from the indexed knowledge base to infer the final answer.

article thumbnail

An Algorithm for a Better Bookshelf

Hacker News

Sign In Sign Up Communications of the ACM About Us Frequently Asked Questions Contact Us Follow Us CACM on Twitter CACM on Reddit CACM on LinkedIn News Architecture and Hardware An Algorithm for a Better Bookshelf Managing the strategic positioning of empty spaces. However, no one could beat the log 2 n cost of the 1981 algorithm.

Algorithm 112
article thumbnail

You need much less memory than time

Hacker News

Williams proof relies on a space-efficient tree evaluation algorithm by James Cook and Ian Mertz from last years STOC conference. Cook and Mertzs algorithm builds on earlier work on catalytic computing, highlighted in a recent Quanta article. Williams then applies the tree evaluation algorithm of Cook and Mertz.