Tootfinder

Bericht: Entlassungen bei "Oblivion Remastered"-Studio Virtuos
Beim Entwicklerstudio Virtuos sollen 300 Stellen gestrichen werden, berichtet ein Journalist. Betroffen ist demnach auch das Team hinter "Oblivion Remastered".

Terwijl de klimaatschuld oploopt, nemen wij een tweede hypotheek https://www.nu.nl/klimaat/6368692/terwijl-de-klimaatschuld-oploopt-nemen-wij-een-tweede-hypotheek.html

Terwijl de klimaatschuld oploopt, nemen wij een tweede hypotheek
In de rubriek De broeikas schrijft klimaatverslaggever Jeroen Kraan wekelijks over wat hem opvalt. Deze week: Europa heeft een flinke klimaatschuld opgebouwd. Gaan we aflossen, of nemen we een tweede hypotheek?

Silentflow: Leveraging Trusted Execution for Resource-Limited MPC via Hardware-Algorithm Co-design
Zhuoran Li, Hanieh Totonchi Asl, Ebrahim Nouri, Yifei Cai, Danella Zhao
https://arxiv.org/abs/2508.13357

Silentflow: Leveraging Trusted Execution for Resource-Limited MPC via Hardware-Algorithm Co-design
Secure Multi-Party Computation (MPC) offers a practical foundation for privacy-preserving machine learning at the edge, with MPC commonly employed to support nonlinear operations. These MPC protocols fundamentally rely on Oblivious Transfer (OT), particularly Correlated OT (COT), to generate correlated randomness essential for secure computation. Although COT generation is efficient in conventional two-party settings with resource-rich participants, it becomes a critical bottleneck in real-worl…

Mehrere Orte in #Norwegen verzeichneten diese Woche in der Nacht ungewöhnlich hohe Temperaturen.
In #Skrova fiel das Thermometer nicht unter 20,7 Grad – ein seltener Fall so weit im Norden. Bereits sechs Nächte in Folge wurden als

Sommerværet: Tropenatt flere steder i Norge
Flere steder i landet var det tropenatt i natt. På Skrova fyr i Lofoten opplever de en uvanlig god sommer.

"Oblivion Remastered": Erster Patch für Performance-Probleme ist da
Über zwei Monate nach dem Release von "Oblivion Remastered" gibt es nun einen Patch, der die mangelhafte Performance verbessern soll.

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
Shabarish Chenakkod, Micha{\l} Derezi\'nski, Xiaoyu Dong
https://arxiv.org/abs/2508.14234

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $ε\geq d^{-O(1)}$, there is a random $\tilde O(d/ε^2)\times n$ matrix $Π$ with $\tilde O(\log(d)/ε)$ non-zeros per column such that for any $A\in\mathbb{R}^{n\times d}$, with high probability, $(1-ε)\|Ax\|\leq\|ΠAx\|\leq(1+ε)\|Ax\|$ for all $x\in\mathbb{R}^d$, where…

Demonstranten worden geframed als schuldig aan het geweld dat juist gepleegd wordt door agenten…
https://www.groene.nl/arti…

Duitse Palestina-demonstraties stuiten op steeds fellere repressie
Berlijn – Terwijl de wereldwijde kritiek op het geweld in Gaza toeneemt en het dodental oploopt, leidt Duitslands krampachtige verhouding tot Israël tot steeds fellere repressie van solidariteit met Palestina.

Path-Oblivious Entanglement Swapping for the Quantum Internet
Vincent Mutolo, Rhea Parekh, Dan Rubenstein
https://arxiv.org/abs/2509.13993 https://arxiv.or…

Path-Oblivious Entanglement Swapping for the Quantum Internet
Proposed Bell pair swapping protocols, an essential component of the Quantum Internet, are planned-path: specific, structured, routing paths are reserved prior to the execution of the swapping process. This makes sense when one assumes the state used in the swapping process is expensive, fragile, and unstable. However, lessons from classical networking have shown that while reservations seem promising in concept, flexible, reservation-light or free approaches often outperform their more restric…

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan, S\'ebastien Tavenas
https://arxiv.org/abs/2509.10725

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
We investigate the closure properties of read-once oblivious Algebraic Branching Programs (roABPs) under various natural algebraic operations and prove the following. - Non-closure under factoring: There is a sequence of explicit polynomials $(f_n(x_1,\ldots, x_n))_n$ that have $\mathsf{poly}(n)$-sized roABPs such that some irreducible factor of $f_n$ does not have roABPs of superpolynomial size in any order. - Non-closure under powering: There is a sequence of polynomials $(f_n(x_1,\ldots,…

ODoQ: Oblivious DNS-over-QUIC
Aditya Kulkarni, Tamal Das, Vivek Balachandran
https://arxiv.org/abs/2509.11123 https://arxiv.org/pdf/2509.11123

ODoQ: Oblivious DNS-over-QUIC
The Domain Name System (DNS), which converts domain names to their respective IP addresses, has advanced enhancements aimed at safeguarding DNS data and users' identity from attackers. The recent privacy-focused advancements have enabled the IETF to standardize several protocols. Nevertheless, these protocols tend to focus on either strengthening user privacy (like Oblivious DNS and Oblivious DNS-over-HTTPS) or reducing resolution latency (as demonstrated by DNS-over-QUIC). Achieving both withi…