Tootfinder

KI-Update: ChatEurope, KI in Schulen, Medizinische KI, Meta-Gehälter, OpenAI
Das "KI-Update" liefert werktäglich eine Zusammenfassung der wichtigsten KI-Entwicklungen.
https://w…

I've enjoyed Michael Madsen in films ever since I first saw Reservoir Dogs, probably when I was 13 or 14, right after it came out. And then in Species, Sin City, Kill Bill- and the most recent Madsen thing I've seen, The Hateful Eight, from 10 years ago. And he was in 8 movies last year, and 4 still upcoming! Truly one of our time's greatest actors, and amazing right up to the end. He'll be missed. RIP

Otra víctima del 2025. Michael Madsen. 🥹
https://elpais.com/cultura/2025-07-03/muere-michael-madsen-actor-fetiche-de-tarantino-en-kill-bill-y-reservoir-dogs.html

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

Wheel-like bricks and minimal matching covered graphs
A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a matching covered graph G is a removable doubleton if G-e-f is matching covered, but neither G-e nor G-f is. Removable edges and removable doubletons are called removable classes, introduced by Lovasz and Plummer in connection with ear decompositions of matching …

#KINutzen #Retröt
Können KI-Modelle für medizinische #Röntgenbilder unbewusst diskriminieren? Eine neue Studie zeigt, dass selbst auf Expertenniveau arbeitende Systeme wie

Bias in der Medizin: Wenn KI-Röntgen-Diagnostik nicht neutral ist
Wie fair ist KI in der Medizin wirklich? Diese Studie offenbart Verzerrungen in der Diagnose marginalisierter Gruppen.

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
Seongbeom Park
https://arxiv.org/abs/2507.00047 https://arxiv.…

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
The profile-based matching problem is the problem of finding a matching that optimizes profile from an instance $(G, r, \langle u_1, \dots, u_r \rangle)$, where $G$ is a bipartite graph $(A \cup B, E)$, $r$ is the number of utility functions, and $u_i: E \to \{ 0, 1, \dots, U_i \}$ is utility functions for $1 \le i \le r$. A matching is optimal if the matching maximizes the sum of the 1st utility, subject to this, maximizes the sum of the 2nd utility, and so on. The profile-based matching can e…

Fact Sheet: Russia's Kidnapping and Re-education of Ukraine's Children
https://medicine.yale.edu/news-article/fact-sheet-russias-kidnapping-and-re-education-of-ukraines-children/

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

Byzantine Stable Matching
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to be stable if no pair of agents prefer each other over their current matching. We consider solving stable matching in a distributed synchronous setting, where each agent is its own process. Moreover, we assume up to $t_L$ agents on one side and $t_R$ on the…

Automatische Schadensermittlung per KI: Scanner jetzt an vier deutschen Airports
Auch in Deutschland werden Mietwagen von KI-Scannern auf Schäden untersucht. Die nötige Technik gibt es nun an vier hiesigen Flughäfen, der fünfte soll folgen.

Höhenflug des Bitcoin: Die Alternativen profitieren diesmal nicht
Die kleineren Kryptowährungen haben bislang fast immer die Kursschwankungen des Bitcoin mitgemacht. Zuletzt war das aber anders, der Bitcoin zieht jetzt davon.