Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@benb@osintua.eu
2026-02-10 13:12:43

Kremlin pushes for closed-door Ukraine talks, says Alaska summit understandings are foundational: benborges.xyz/2026/02/10/kreml

@servelan@newsie.social
2026-03-10 04:36:53

Vast Ship Clusters and Speeding Tankers Point to Hormuz Jamming | Financial Post
financialpost.com/pmn/business

@arXiv_csDS_bot@mastoxiv.page
2026-02-10 10:45:35

Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
arxiv.org/abs/2602.08542 arxiv.org/pdf/2602.08542 arxiv.org/html/2602.08542
arXiv:2602.08542v1 Announce Type: new
Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center. In the dynamic setting, the graph is subject to adversarial edge updates, and the goal is to maintain explicitly an exact $(k, z)$-clustering solution in the induced shortest-path metric.
While efficient dynamic $k$-center approximation algorithms on graphs exist [Cruciani et al. SODA 2024], to the best of our knowledge, no prior work provides similar results for the dynamic $(k,z)$-clustering problem. As the main result of this paper, we develop a randomized incremental $(k, z)$-clustering algorithm that maintains with high probability a constant-factor approximation in a graph undergoing edge insertions with a total update time of $\tilde O(k m^{1 o(1)} k^{1 \frac{1}{\lambda}} m)$, where $\lambda \geq 1$ is an arbitrary fixed constant. Our incremental algorithm consists of two stages. In the first stage, we maintain a constant-factor bicriteria approximate solution of size $\tilde{O}(k)$ with a total update time of $m^{1 o(1)}$ over all adversarial edge insertions. This first stage is an intricate adaptation of the bicriteria approximation algorithm by Mettu and Plaxton [Machine Learning 2004] to incremental graphs. One of our key technical results is that the radii in their algorithm can be assumed to be non-decreasing while the approximation ratio remains constant, a property that may be of independent interest.
In the second stage, we maintain a constant-factor approximate $(k,z)$-clustering solution on a dynamic weighted instance induced by the bicriteria approximate solution. For this subproblem, we employ a dynamic spanner algorithm together with a static $(k,z)$-clustering algorithm.
toXiv_bot_toot

@radioeinsmusicbot@mastodonapp.uk
2026-03-10 17:34:54

🇺🇦 Auf radioeins läuft...
Celeste:
🎵 Stop This Flame
#NowPlaying #Celeste
funkastik.bandcamp.com/track/c
open.spotify.com/track/1bObrsJ

@netzschleuder@social.skewed.de
2026-03-08 23:00:05

sp_colocation: Social co-locations (2018)
Network of colocations between peoople, based on the information on which RFID readers received information from the RFID tags. Namely, we define two individuals to be in co-presence if the same exact set of readers have received signals from both individuals during a 20s time window.
This network has 100 nodes and 394247 edges.
Tags: Social, Offline, Unweighted, Weighted, Temporal, Metadata

sp_colocation: Social co-locations (2018). 100 nodes, 394247 edges. https://networks.skewed.de/net/sp_colocation#InVS13
@inthehands@hachyderm.io
2026-01-09 20:14:07
Content warning: photograph in linked article shows blood on a steering wheel

The first paragraphs of this article are big news (I think?? IANAL): the FBI tried to shut MN out of the investigation of ICE’s murder of Renee Good, which almost certainly is the start of a cover-up. Minnesota initially threw up its hands and said “well that sucks.”
Today we learn that Minnesota and Hennepin County are still gathering evidence themselves, apparently independently of the FBI. My hope is that this is in pursuit of state charges, in defiance of the Trump-controlled FBI.
minnesotareformer.com/2026/01/

@bourgwick@heads.social
2026-01-09 16:04:40

jerry garcia's tiger guitar expected to go for $1-$2 million. espn.com/nfl/story/_/id/475417

An asteroid that NASA used for target practice a few years ago
was nudged into a slightly different route around the sun,
findings that could help divert a future incoming killer space rock, scientists reported Friday.
It’s the first time that a celestial body’s orbit around the sun was deliberately changed.
The asteroid that NASA’s #Dart spacecraft slammed into was never a threat to Ea…

@servelan@newsie.social
2026-03-10 04:34:11

Vast Ship Clusters and Speeding Tankers Point to Hormuz Jamming | Financial Post
financialpost.com/pmn/business

@radioeinsmusicbot@mastodonapp.uk
2026-02-09 11:26:52

🇺🇦 Auf radioeins läuft...
Sampha:
🎵 Blood On Me
#NowPlaying #Sampha
celestikah.bandcamp.com/track/
open.spotify.com/track/2D9aPhc