Tootfinder

I don't follow this person (below), any ideas why they'd show up in my home feed?
No hashtags.
cc @…
https://lemmy.ca/post/48073052

Free Nanaimo Bars For Everyone Who Contributes to OSM! - Lemmy.ca
Time to build an alternative to Google Maps due their incidents [https://www.cbc.ca/news/canada/british-columbia/why-are-provincial-parks-listed-as-state-parks-on-google-maps-1.7466824l]…

«Fed up with ChatGPT, Latin America is building its own»
Please folks, the torment nexus isn't any better just because it's home-made… I hate how the intellectually bankrupt narratives of Silicon Valley are just copied over, as if that solved anything.
https://restofworld.org/2025/chatgpt-latin-america-alternative-latamgpt/

#ndwgoecountdown Vortrag – Wie alt ist eigentlich der Mond?
Wer verrät schon gerne seine Alter? Der Mond jedenfalls nicht! Seit Langem bemühen sich Forschende, die Geburtsstunde unseres kosmischen Begleiters zu bestimmen. Wichtigster Anhaltspunkt: Mondgestein, von Apollo-Astronauten zurück zur Erde gebracht. Der Vortrag von Prof. Kleine gibt einen Überblick über den aktuellen …

Compressing Suffix Trees by Path Decompositions
Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Ragnar Groot Koerkamp, Giovanni Manzini, Nicola Prezza
https://arxiv.org/abs/2506.14734

Compressing Suffix Trees by Path Decompositions
In classic suffix trees, path compression works by replacing unary suffix trie paths with pairs of pointers to $T$, which must be available in the form of some random access oracle at query time. In this paper, we revisit path compression and show that a more careful choice of pointers leads to a new elegant, simple, and remarkably efficient way to compress the suffix tree. We begin by observing that an alternative way to path-compress the suffix trie of $T$ is to decompose it into a set of (di…

Burrow: Home burglary altered Batmobile plans https://www.espn.com/nfl/story/_/id/45693169/home-burglary-altered-batmobile-plans

Har sammanställt ett fett dokument med ca 100 sidor till min kollega som ska ta över en arbetsuppgift. Jag har klistrat in alla VB-script och pythonscript som jag använder.
Jag vet att hon aldrig använt något av dessa men tänker att om hon ska kunna ändra i dem och äga processen så behöver hon lära sig hur makron och vb-script fungerar hur det funkar att installera pythonmiljön och några moduler samt att köra dem i terminal.
Är jag småsint som delar kod, men inte filer, för att …

COLI: A Hierarchical Efficient Compressor for Large Images
Haoran Wang, Hanyu Pei, Yang Lyu, Kai Zhang, Li Li, Feng-Lei Fan
https://arxiv.org/abs/2507.11443

COLI: A Hierarchical Efficient Compressor for Large Images
The escalating adoption of high-resolution, large-field-of-view imagery amplifies the need for efficient compression methodologies. Conventional techniques frequently fail to preserve critical image details, while data-driven approaches exhibit limited generalizability. Implicit Neural Representations (INRs) present a promising alternative by learning continuous mappings from spatial coordinates to pixel intensities for individual images, thereby storing network weights rather than raw pixels a…

'I know the names': Former Trump advisor accuses him of suppressing key Epstein documents - Alternet.org
https://www.alternet.org/alan-dershowitz-trump-epstein/

This Thursday the moving truck arrives and the following Tuesday we move into our new home. Therefore, it's time for a new alias, and this poll offers some possible alternatives. Please boost for maximum meaningless results.
Some background:
- we are moving to the Barrie area.
- officially, within the Town of Innisfil
- easy walking distance to Belle Aire Beach
- within Innisfil, we are in the community of Belle Ewart
Disclaimer - I am not legally bound by the results of this survey.
Barrie Beach Bum
Innocuous In Innisfil
Prince of Belle Aire
Ewartian Era

Spectral partitioning of graphs into compact, connected regions
Ewan Davies, Ryan Job, Maxine Kampbell, Hannah Kim, Hyojin Seo
https://arxiv.org/abs/2506.13982

Spectral partitioning of graphs into compact, connected regions
We define and study a spectral recombination algorithm, SpecReCom, for partitioning a graph into a given number of connected parts. It is straightforward to introduce additional constraints such as the requirement that the weight (or number of vertices) in each part is approximately balanced, and we exemplify this by stating a variant, BalSpecReCom, of the SpecReCom algorithm. We provide empirical evidence that the algorithm achieves more compact partitions than alternatives such as RevReCom by…