@leftsidestory@mstdn.social2026-01-12 00:30:05
Market Value 💵
市场价值 💵
📷 Nikon F4E
🎞️ ERA 100, expired 1993
#filmphotography #Photography #blackandwhite
@arXiv_csDS_bot@mastoxiv.page2026-02-10 10:45:35
Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
https://arxiv.org/abs/2602.08542 https://arxiv.org/pdf/2602.08542 https://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
@Techmeme@techhub.social2025-12-08 19:25:49
Uber launches Uber Intelligence, an insights platform that lets advertisers tap into Uber's data about customer trips and deliveries (Lara O'Reilly/Business Insider)
https://www.businessinsider.com/uber-ads-launches-intelli…
@Mediagazer@mstdn.social2025-12-08 19:25:41
Uber launches Uber Intelligence, an insights platform that lets advertisers tap into Uber's data about customer trips and deliveries (Lara O'Reilly/Business Insider)
https://www.businessinsider.com/uber-ads-launches-intelli…
@mgorny@social.treehouse.systems2025-12-26 10:41:26
I don't think I'm ever going to enjoy gifts.
I can get why people would give them to children. After all, children don't have their own budget. However, I'm talking about occasional gifts, not a new toy every second week, because "we must outcompete the other grandparents". But to adults?
Once I've heard that you should gift people with what they won't buy themselves. Well, that's won't work for me. I'm a minimalist. If I don't need something, I don't want to have it. Unnecessary junk is only emotional burden to me.
I can get why you'd enjoy something handmade. But something people bought? If I need something, I can buy it myself, when I need it. And I definitely don't need people to prove to me that they never cared to learn who I am, and just buy whatever they like or whatever is "fashionable"; which usually means exactly the opposite of what I'd prefer (i.e. something minimalistic). Or even worse, I don't need people manipulating me through gifts.
Sweets? Besides my diabetes, I don't really enjoy expensive shit that people generally buy because it's what's advertised. For the money they waste on it, I'd buy three times as much sweets I'd actually enjoy.
Gift cards? Oh yes, "you aren't supposed to give money, so let's just give the equivalent of money that's actually worth less than money". Actual money? And here we reach the true nonsense; we exchange the same amount of money, so it's just pointless gesture. Unless one of us gives less money…
What I'd really like, as a gift? Maybe that people would finally bother accepting me as who I am. The absolute minimum of caring that I hate consumerism, and not fueling it "for me".
#AntiCapitalism #minimalism #ActuallyAutistic
@raiders@darktundra.xyz2026-01-06 00:28:06
Mano a Mano con Ashton Jeanty https://www.raiders.com/video/mano-a-mano-con-ashton-jeanty-nfl-2025
@Techmeme@techhub.social2025-12-02 13:30:55
Chinese short-video company Kuaishou launches Kling Video O1, saying it is the first multimodal AI model to unify video generation, editing, and post-production (Ben Jiang/South China Morning Post)
https://www.scmp.com/tech/tech-trends/a…
@lightweight@mastodon.nzoss.nz2026-01-29 18:55:18
Oooo, RNZ's NineToNoon is advertising a segment on 'open source granny flats' being developed by Prof Anthony Hōete (Ngāti Awa) at the University of Auckland at 9:35 this morning... interesting. I'll post a link to the podcast following.
@Mediagazer@mstdn.social2025-12-02 13:30:35
Chinese short-video company Kuaishou launches Kling Video O1, saying it is the first multimodal AI model to unify video generation, editing, and post-production (Ben Jiang/South China Morning Post)
https://www.scmp.com/tech/tech-trends/a…
@raiders@darktundra.xyz2026-01-05 23:01:31
Mano a Mano con Ashton Jeanty https://www.raiders.com/video/mano-a-mano-con-ashton-jeanty-nfl-2025