@Techmeme@techhub.social2026-03-11 20:56:03
Microsoft says that Windows 11 Xbox mode, a controller-first, full-screen gaming interface, will begin rolling out in April and work across all PC form factors (Abhijith M B/Windows Latest)
https://www.windowslatest.com/2…
@heiseonline@social.heise.de2026-02-11 16:07:00
@NFL@darktundra.xyz2026-03-11 05:49:23
Barnwell makes sense of the called-off Maxx Crosby trade: What happens in the aftermath? https://www.espn.com/nfl/story/_/id/48168497/2026-nfl-free-agency-maxx-crosby-trade-backed-physical-raiders-ravens-edge-rushers…
@toxi@mastodon.thi.ng2026-03-10 11:13:52
Some _very_ early algorithm concept/pre-viz sketches/explorations for the Tron Legacy (2010) intro sequence. They informed another concept/approach in which we applied a similar algorithm to progressively trace out edges of an initially invisible and super detailed 3D city mesh. This required a lot of effort to retopologize the (huge) geometry supplied and creating a multi-res navigation graph to prioritize long/major edges over shorter ones, filter out undesired edges/directions, thereby cr…
@arXiv_csDS_bot@mastoxiv.page2026-02-10 09:06:51
Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
Pan Peng, Yuyang Wang
https://arxiv.org/abs/2602.07394 https://arxiv.org/pdf/2602.07394 https://arxiv.org/html/2602.07394
arXiv:2602.07394v1 Announce Type: new
Abstract: We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $ T $ is defined implicitly by $ G $ and the randomness of the algorithm. It is known that LCAs for spanning trees do not exist in general graphs, even for simple graph families. We identify a natural and well-studied class of graphs -- \emph{expander graphs} -- that do admit \emph{sublinear-time} LCAs for spanning trees. This is perhaps surprising, as previous work on expanders only succeeded in designing LCAs for \emph{sparse spanning subgraphs}, rather than full spanning trees. We design an LCA with probe complexity $ O\left(\sqrt{n}\left(\frac{\log^2 n}{\phi^2} d\right)\right)$ for graphs with conductance at least $ \phi $ and maximum degree at most $ d $ (not necessarily constant), which is nearly optimal when $\phi$ and $d$ are constants, since $\Omega(\sqrt{n})$ probes are necessary even for expanders. Next, we show that for the natural class of \emph{\ER graphs} $ G(n, p) $ with $ np = n^{\delta} $ for any constant $ \delta > 0 $ (which are expanders with high probability), the $ \sqrt{n} $ lower bound can be bypassed. Specifically, we give an \emph{average-case} LCA for such graphs with probe complexity $ \tilde{O}(\sqrt{n^{1 - \delta}})$.
Finally, we extend our techniques to design LCAs for the \emph{minimum spanning tree (MST)} problem on weighted expander graphs. Specifically, given a $d$-regular unweighted graph $\bar{G}$ with sufficiently strong expansion, we consider the weighted graph $G$ obtained by assigning to each edge an independent and uniform random weight from $\{1,\ldots,W\}$, where $W = O(d)$. We show that there exists an LCA that is consistent with an exact MST of $G$, with probe complexity $\tilde{O}(\sqrt{n}d^2)$.
toXiv_bot_toot
@macandi@social.heise.de2026-04-10 09:52:00
@heiseonline@social.heise.de2026-03-11 13:23:00
Britisches Unterhaus gegen Social-Media-Aus für Kinder
In Großbritannien wird intensiv über ein Social-Media-Verbot für Kinder diskutiert. Eine Abstimmung im Parlament versetzt Befürwortern einen Dämpfer.
https://ww…
@arXiv_csDS_bot@mastoxiv.page2026-02-10 09:00:08
Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
Kanstantsin Pashkovich, Thomas Snow
https://arxiv.org/abs/2602.07355 https://arxiv.org/pdf/2602.07355 https://arxiv.org/html/2602.07355
arXiv:2602.07355v1 Announce Type: new
Abstract: We study online algorithms for maximum cardinality matchings with edge arrivals in graphs of low degree. Buchbinder, Segev, and Tkach showed that no online algorithm for maximum cardinality fractional matchings can achieve a competitive ratio larger than $4/(9-\sqrt 5)\approx 0.5914$ even for graphs of maximum degree three. The negative result of Buchbinder et al. holds even when the graph is bipartite and edges are revealed according to vertex arrivals, i.e. once a vertex arrives, all edges are revealed that include the newly arrived vertex and one of the previously arrived vertices. In this work, we complement the negative result of Buchbinder et al. by providing an online algorithm for maximum cardinality fractional matchings with a competitive ratio at least $4/(9-\sqrt 5)\approx 0.5914$ for graphs of maximum degree three. We also demonstrate that no online algorithm for maximum cardinality integral matchings can have the competitive guarantee $0.5807$, establishing a gap between integral and fractional matchings for graphs of maximum degree three. Note that the work of Buchbinder et al. shows that for graphs of maximum degree two, there is no such gap between fractional and integral matchings, because for both of them the best achievable competitive ratio is $2/3$. Also, our results demonstrate that for graphs of maximum degree three best possible competitive ratios for fractional matchings are the same in the vertex arrival and in the edge arrival models.
toXiv_bot_toot
@toxi@mastodon.thi.ng2026-02-10 11:09:15
That time when Johnny Klimek (composer for Cloud Atlas and many others of Tom Tykwer films) and Dr. Motte (founder of the Berlin Loveparade) got together in 1996 to create their one-off project Holy Language...
Fireplace (original version, 9 minutes)
https://www.youtube.com/watch?v=DgL3DNn7OGE
@heiseonline@social.heise.de2026-04-09 13:14:00