Tootfinder

It's tempting to do everything as fast as possible:
listen to podcasts on double speed,
work in email-free sprints,
or train at lung-bursting intensity in the gaps between your morning meditation and the school run.
But evidence is piling up that the last one might not be as beneficial as it seems
– and that, in fact, just introducing a lot more ultra-low-intensity movement into your schedule can improve your fitness as well as your quality of life,
…

"The Daily Beast’s newsletter The Swamp revealed Monday how Cruz was caught touring the Parthenon in Athens, Greece, 24 hours after the Guadalupe River burst its banks, sweeping away dozens of lives in an unspeakable horror whose full effects are still unfolding."
Ted Cruz’s Claim He Returned to Texas as ‘Fast as Humanly Possible’ Crumbles
https://www.thedailybeast.com/vacationing-ted-cruzs-as-fast-as-humanly-possible-return-claim-crumbles/

Event2Audio: Event-Based Optical Vibration Sensing
Mingxuan Cai, Dekel Galor, Amit Pal Singh Kohli, Jacob L. Yates, Laura Waller
https://arxiv.org/abs/2507.03273

Event2Audio: Event-Based Optical Vibration Sensing
Small vibrations observed in video can unveil information beyond what is visual, such as sound and material properties. It is possible to passively record these vibrations when they are visually perceptible, or actively amplify their visual contribution with a laser beam when they are not perceptible. In this paper, we improve upon the active sensing approach by leveraging event-based cameras, which are designed to efficiently capture fast motion. We demonstrate our method experimentally by rec…

Is there any kind of symbol/articulation/whatever, by any rare chance, to indicate that a specific arpeggio played with a piano over a chord must be done as fast as possible?
#Piano #Scores #MusicTheory

Exact Matching in Matrix Multiplication Time
Ryotaro Sato, Yutaro Yamaguchi
https://arxiv.org/abs/2508.04081 https://arxiv.org/pdf/2508.04081

Exact Matching in Matrix Multiplication Time
Initiated by Mulmuley, Vazirani, and Vazirani (1987), many algebraic algorithms have been developed for matching and related problems. In this paper, we review basic facts and discuss possible improvements with the aid of fast computation of the characteristic polynomial of a matrix. In particular, we show that the so-called exact matching problem can be solved with high probability in asymptotically the same time order as matrix multiplication. We also discuss its extension to the linear matro…

This https://arxiv.org/abs/2412.08556 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
Consider the scenario where multiple agents have to move in an optimal way through a network, each one towards their ending position while avoiding collisions. By optimal, we mean as fast as possible, which is evaluated by a measure known as the makespan of the proposed solution. This is the setting studied in the Multiagent Path Finding problem. In this work, we additionally provide the agents with a way to communicate with each other. Due to size constraints, it is reasonable to assume that t…

A Computational Proof of the Highest-Scoring Boggle Board
Dan Vanderkam
https://arxiv.org/abs/2507.02117 https://arxiv.org/pdf/2507.0…

A Computational Proof of the Highest-Scoring Boggle Board
Finding all the words on a Boggle board is a classic computer programming problem. With a fast Boggle solver, local optimization techniques such as hillclimbing and simulated annealing can be used to find particularly high-scoring boards. The sheer number of possible Boggle boards has historically prevented an exhaustive search for the global optimum board. We apply Branch and Bound and a decision diagram-like data structure to perform the first such search. We find that the highest-scoring boa…