No article text was recorded for this version.
hierarchical update localization
Version 1 of 166 papers85 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
- Blog: Fully Dynamic-Clustering with Fast Update Time and Small Recourse
- Blog: Online Hierarchical Clustering Approximations
- Blog: A Fully Dynamic Algorithm for k-Regret Minimizing Sets
- Blog: Fully dynamic hierarchical diameter k-clustering and k-center
- Blog: Online Discrepancy with Recourse for Vectors and Graphs
- Blog: Indexing Highly Dynamic Hierarchical Data
- Blog: Quantization for Vector Search under Streaming Updates
- Blog: Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces
- Blog: Continual Learning in Open-vocabulary Classification with Complementary Memory Systems
- Blog: Fully Dynamic k-Center Clustering Made Simple
- Blog: Incremental Tree-Based Inference with Dependent Normalized Random Measures
- Blog: Efficient and Stable Fully Dynamic Facility Location
- Blog: Online Steiner Tree with Deletions
- Blog: Fully Dynamic k-Clustering in Õ(k) Update Time
- Blog: Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
- Blog: Efficient Discovery of Services Specified in Description Logics Languages
- Blog: Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
- Blog: Dynamic Euclidean Bottleneck Matching
- Blog: Clustering with Instance-Level Constraints
- Blog: Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
- Blog: Design of Dynamic Algorithms via Primal-Dual Method
- Blog: Filtering Bounded Knapsack Constraints in Expected Sublinear Time
- Blog: Clustering High Dimensional Dynamic Data Streams
- Blog: Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
- Blog: Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time
- Blog: A Dynamic Algorithm for Weighted Submodular Cover Problem
- Blog: Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
- Blog: Dynamically Adjusting Categories to Accommodate Changing Contexts
- Blog: Maintaining Consistency in Hierarchical Reasoning
- Blog: A Dynamic Algorithm for Weighted Submodular Cover Problem
- Blog: Non-monotone Submodular Optimization: $p$-Matchoid Constraints and Fully Dynamic Setting
- Blog: Fully Dynamic Consistent k-Center Clustering
- Blog: Improving Dual-Encoder Training through Dynamic Indexes for Negative Mining
- Blog: Fully Dynamic Algorithms for Euclidean Steiner Tree
- Blog: Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
- Blog: Stability of epsilon-Kernels
- Blog: Dynamic High-Dimensional Facility Location with Low Recourse
- Blog: Fast, precise and dynamic distance queries
- Blog: A New Trade-Off for Deterministic Dictionaries
- Blog: Collision detection for deforming necklaces
- Blog: Fully Dynamic k-Clustering with Fast Update Time and Small Recourse
- Blog: An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
- Blog: Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
- Blog: Online and Dynamic Algorithms for Set Cover
- Blog: A New Deterministic Algorithm for Dynamic Set Cover
- Blog: Maintaining Perfect Matchings at Low Cost
- Blog: Fully Dynamic Algorithm for Constrained Submodular Optimization
- Blog: Scalable Graph Networks for Particle Simulations
- Blog: Fully Dynamic Submodular Maximization over Matroids
- Blog: Fully Dynamic Submodular Maximization over Matroids
- Blog: Fully Dynamic $k-\text{Clustering}$ with Fast Update Time and Small Recourse
- Blog: Experimental Evaluation of Fully Dynamic k-Means via Coresets
- Blog: Dynamic Clustering to Minimize the Sum of Radii
- Blog: Minimizing the Aggregate Movements for Interval Coverage
- Blog: Distributed Multi-Agent Hierarchy Construction for Dynamic DCOPs in Mobile Sensor Teams
- Blog: Incremental Clustering and Dynamic Information Retrieval
- Blog: Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference
- Blog: DIPS: Optimal Dynamic Index for Poisson πps Sampling
- Blog: Dynamic Maintenance of Wavelet-Based Histograms
Showing 60 of 66 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_hierarchical_update_localization_c1869594,
title = {hierarchical update localization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-update-localization/rdr_c18695945986475a89b9b9f49157a7c8},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_hierarchical_update_localization_c1869594_v1,
title = {hierarchical update localization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-update-localization/rdr_c18695945986475a89b9b9f49157a7c8/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}