Tootfinder

'Regeling van werkzaamheden' die voor de hele namiddag en avond ingepland is.
Ik heb het altijd al een best grappige omschrijving gevonden voor dit soort debatten. 😉
@…
#Politiek #debat

On the local metric dimension of $K_4$-free graphs
Ali Ghalavand, Sandi Klav\v{z}ar, Xueliang Li
https://arxiv.org/abs/2506.00414 https://

On the local metric dimension of $K_4$-free graphs
Let $G$ be a graph of order $ n(G) $, local metric dimension $ \dim_l(G) $, and clique number $ ω(G) $. It has been conjectured that if $ n(G) \geq ω(G) + 1 \geq 4 $, then $ \dim_l(G) \leq \left( \frac{ω(G) - 2}{ω(G) - 1} \right) n(G) $. In this paper the conjecture is confirmed for the case $ ω(G) = 3 $. Consequently, a problem regarding the local metric dimension of planar graphs is also resolved.

HouseTS: A Large-Scale, Multimodal Spatiotemporal U.S. Housing Dataset
Shengkun Wang, Yanshen Sun, Fanglan Chen, Linhan Wang, Naren Ramakrishnan, Chang-Tien Lu, Yinlin Chen
https://arxiv.org/abs/2506.00765

HouseTS: A Large-Scale, Multimodal Spatiotemporal U.S. Housing Dataset
Accurate house-price forecasting is essential for investors, planners, and researchers. However, reproducible benchmarks with sufficient spatiotemporal depth and contextual richness for long horizon prediction remain scarce. To address this, we introduce HouseTS a large scale, multimodal dataset covering monthly house prices from March 2012 to December 2023 across 6,000 ZIP codes in 30 major U.S. metropolitan areas. The dataset includes over 890K records, enriched with points of Interest (POI),…

Palmer’s Bar in #Minneapolis will close in September #Minnesota
Many good memories of Palmer's
“there are dives and dives in this world. There’s the type Guy Fieri calls out, old joints that might not feel like they need to get their hair done before seeing company but are nonetheless f…

Palmer’s, legendary 119-year-old Minneapolis dive bar, will close in September
The owners cited declining alcohol sales at the watering hole once hailed by Esquire as one of the best bars in America.

Approximate Light Spanners in Planar Graphs
Hung Le, Shay Solomon, Cuong Than, Csaba D. T\'oth, Tianyi Zhang
https://arxiv.org/abs/2505.24825 https://

Approximate Light Spanners in Planar Graphs
In their seminal paper, Althöfer et al. (DCG 1993) introduced the {\em greedy spanner} and showed that, for any weighted planar graph $G$, the weight of the greedy $(1+ε)$-spanner is at most $(1+\frac{2}ε) \cdot w(MST(G))$, where $w(MST(G))$ is the weight of a minimum spanning tree $MST(G)$ of $G$. This bound is optimal in an {\em existential sense}: there exist planar graphs $G$ for which any $(1+ε)$-spanner has a weight of at least $(1+\frac{2}ε) \cdot w(MST(G))$. However, as an {\em a…

This https://arxiv.org/abs/2505.12311 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Scene-Adaptive Motion Planning with Explicit Mixture of Experts and Interaction-Oriented Optimization
Despite over a decade of development, autonomous driving trajectory planning in complex urban environments continues to encounter significant challenges. These challenges include the difficulty in accommodating the multi-modal nature of trajectories, the limitations of single expert in managing diverse scenarios, and insufficient consideration of environmental interactions. To address these issues, this paper introduces the EMoE-Planner, which incorporates three innovative approaches. Firstly, …

Morgen dus waarschijnlijk de hele dag een van de debatten die de meeste aandacht zal krijgen, maar inhoudelijk totaal niets waard hoogst waarschijnlijk.
@… #politiek #debat

On the maximum number of edges of outer k-planar graphs
Maximilian Pfister
https://arxiv.org/abs/2505.24490 https://arxiv.org/pdf/250…

On the maximum number of edges of outer k-planar graphs
We study the maximum number of straight-line segments connecting $n$ points in convex position in the plane, so that each segment intersects at most $k$ others. This question can also be framed as the maximum number of edges of an outer $k$-planar graph on $n$ vertices. We outline several approaches to tackle the problem with the best approach yielding an upper bound of $(\sqrt{2}+\varepsilon)\sqrt{k}n$ edges (with $\varepsilon \rightarrow 0$ for sufficiently large $k$). We further investigate …

Haptic Rapidly-Exploring Random Trees: A Sampling-based Planner for Quasi-static Manipulation Tasks
Lin Yang, Huu-Thiet Nguyen, Donghan Yu, Chen Lv, Domenico Campolo
https://arxiv.org/abs/2506.00351

Haptic Rapidly-Exploring Random Trees: A Sampling-based Planner for Quasi-static Manipulation Tasks
In this work, we explore how conventional motion planning algorithms can be reapplied to contact-rich manipulation tasks. Rather than focusing solely on efficiency, we investigate how manipulation aspects can be recast in terms of conventional motion-planning algorithms. Conventional motion planners, such as Rapidly-Exploring Random Trees (RRT), typically compute collision-free paths in configuration space. However, in manipulation tasks, intentional contact is often necessary. For example, whe…

RealDrive: Retrieval-Augmented Driving with Diffusion Models
Wenhao Ding, Sushant Veer, Yuxiao Chen, Yulong Cao, Chaowei Xiao, Marco Pavone
https://arxiv.org/abs/2505.24808

RealDrive: Retrieval-Augmented Driving with Diffusion Models
Learning-based planners generate natural human-like driving behaviors by learning to reason about nuanced interactions from data, overcoming the rigid behaviors that arise from rule-based planners. Nonetheless, data-driven approaches often struggle with rare, safety-critical scenarios and offer limited controllability over the generated trajectories. To address these challenges, we propose RealDrive, a Retrieval-Augmented Generation (RAG) framework that initializes a diffusion-based planning po…