🇺🇦 #NowPlaying on KEXP's #SonicReducer
Heritage:
🎵 Ready to Roll
#Heritage
https://youthattack.bandcamp.com/track/ready-to-roll
https://open.spotify.com/track/1Jf1AWGBtDrwoOxKguy9as
One of my VR Lighthouses died last month. These things are gyroscopically spinning 24 hours a day for, what, a decade now? Nearly.
No wonder. Mostly the industry seems to be settling on using head-mounted cameras rather than sweeping infra-red beams and receptors on the head anyway.
It is true that lighthouses give accurate positioning, but means I can't easily take the headset next door, say. Or to a party.
So inside-out, as they call it, is fine for the headset now and mostly okay for the hand-controllers.
But it offers no solution at all for the foot-trackers and hip-tracker that I need for puppetting the characters in the #vr #slimeVR #trackers
Rare Colours Blues III🔷🔷
稀有的色彩蓝 III🔷🔷
📷 Pentax MX
🎞️ Harman Phoenix 200 II (FF)
#filmphotography #Photography #Art
'Back in the 70's a researcher named Philip Brickman studied lottery winners and found that people who won big were no happier than anyone else within a few months. He called it the "hedonic treadmill." You get the thing, the feeling fades, you chase the next thing.
The Strive is the hedonic treadmill all over again, but it comes with a mandatory pair of white sneakers and a Claude Max subscription.'
Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
Moran Feldman, Justin Ward
https://arxiv.org/abs/2602.08473 https://arxiv.org/pdf/2602.08473 https://arxiv.org/html/2602.08473
arXiv:2602.08473v1 Announce Type: new
Abstract: We study the problem of maximizing a non-negative monotone submodular objective $f$ subject to the intersection of $k$ arbitrary matroid constraints. The natural greedy algorithm guarantees $(k 1)$-approximation for this problem, and the state-of-the-art algorithm only improves this approximation ratio to $k$. We give a $\frac{2k\ln2}{1 \ln2} O(\sqrt{k})<0.819k O(\sqrt{k})$ approximation for this problem. Our result is the first multiplicative improvement over the approximation ratio of the greedy algorithm for general $k$. We further show that our algorithm can be used to obtain roughly the same approximation ratio also for the more general problem in which the objective is not guaranteed to be monotone (the sublinear term in the approximation ratio becomes $O(k^{2/3})$ rather than $O(\sqrt{k})$ in this case).
All of our results hold also when the $k$-matroid intersection constraint is replaced with a more general matroid $k$-parity constraint. Furthermore, unlike the case in many of the previous works, our algorithms run in time that is independent of $k$ and polynomial in the size of the ground set. Our algorithms are based on a hybrid greedy local search approach recently introduced by Singer and Thiery (STOC 2025) for the weighted matroid $k$-intersection problem, which is a special case of the problem we consider. Leveraging their approach in the submodular setting requires several non-trivial insights and algorithmic modifications since the marginals of a submodular function $f$, which correspond to the weights in the weighted case, are not independent of the algorithm's internal randomness. In the special weighted case studied by Singer and Thiery, our algorithms reduce to a variant of their algorithm with an improved approximation ratio of $k\ln2 1-\ln2<0.694k 0.307$, compared to an approximation ratio of $\frac{k 1}{2\ln2}\approx0.722k 0.722$ guaranteed by Singer and Thiery.
toXiv_bot_toot
'The voters sacked Debbonaire in favour of a more progressive Green MP. ...
Debbonaire became a “senior policy adviser” to FGS Global. This lobbying company... founded by its current chair, Roland Rudd (brother of former Tory minister Amber Rudd).
FGS Global say they are “helping our clients to deliver the right messages to the right people to influence policy in decisive moments”'
The Debbonaire deal: how corporate sinecures keep Labour wedded to the right | Morning S…
Tipp: Automatisches iPhone-Backup im Finder deaktivieren
Wer sein iOS-Gerät per Kabel mit dem Mac synchronisiert, bekommt standardmäßig langwierige Backups serviert. Das muss nicht sein.
https://www.
🇺🇦 #NowPlaying on KEXP's #SonicReducer
Motörhead:
🎵 In the Black
#Motörhead
https://hemimusic.bandcamp.com/track/in-the-black-mot-rhead-cover
https://open.spotify.com/track/7bWOyNTeErT2hDy1REGvfv
🇺🇦 #NowPlaying on KEXP's #SonicReducer
The Cheifs:
🎵 Riot Squad
#TheCheifs
https://genkigenkipanic.bandcamp.com/track/riot-squad
https://open.spotify.com/track/2ADjR8pCw2K1WfYXSnzHVk