Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
representative citing papers
An asynchronous architecture decouples incremental voxel-based mapping from VLM-based semantic enrichment to produce queryable open-vocabulary 3D scene graphs that match or exceed prior methods on segmentation and grounding benchmarks.
A taxonomy of SNN training algorithms is presented with the release of NeuroTrain, an open benchmarking framework for reproducible comparisons across datasets and architectures.
Constructs a logical-relations security model for where-declassification in higher-order languages by halting indistinguishability enforcement after relevant declassifications, yielding stronger guarantees than prior lower-order definitions.
A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.
MutDafny uses 40 mutation operators on 794 real-world Dafny programs to detect weak specifications, manually confirming five such cases at a rate of one per 241 lines.
citing papers explorer
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
Think While You Map: Asynchronous Vision-Language Agents for Incremental 3D Scene Graphs
An asynchronous architecture decouples incremental voxel-based mapping from VLM-based semantic enrichment to produce queryable open-vocabulary 3D scene graphs that match or exceed prior methods on segmentation and grounding benchmarks.
-
NeuroTrain: Surveying Local Learning Rules for Spiking Neural Networks with an Open Benchmarking Framework
A taxonomy of SNN training algorithms is presented with the release of NeuroTrain, an open benchmarking framework for reproducible comparisons across datasets and architectures.
-
Compositional security definitions for higher-order where declassification
Constructs a logical-relations security model for where-declassification in higher-order languages by halting indistinguishability enforcement after relevant declassifications, yielding stronger guarantees than prior lower-order definitions.
-
From Frames to Features: Scalable Zigzag Persistence for Binary Video
A graph encoding of connected-component dynamics enables direct extraction of H0 and H1 zigzag barcodes for binary video, bypassing cubical complexes and achieving linear-time scaling via Dey-Hou decomposition.
-
MutDafny: A Mutation-Based Approach to Assess Dafny Specifications
MutDafny uses 40 mutation operators on 794 real-world Dafny programs to detect weak specifications, manually confirming five such cases at a rate of one per 241 lines.