Pointer machines support working-set heaps with O(1) amortized Push and inverse-Ackermann DecreaseKey, making Dijkstra near-universally optimal with only O(m α(m)) additive overhead.
super hub Mixed citations
APACrefauthors \ 1959
Mixed citation behavior. Most common role is method (60%).
21
Pith papers citing it
18.2k
external citations · Crossref
Method
60% of classified citations
hub tools
citation-role summary
method 3
background 2
citation-polarity summary
claims ledger
- method in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the
- method BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL
- background nρ(ˆµn, µn,h)21{nρ(ˆµn, µn,h)2 > A} = 0. Theorem 6.5(Local asymptotic minimaxity of the profiled location estimator).Assume that X1, X2, . . .are i.i.d. from the local anisotropic HWN experiments defined above and that Assump- 13 tion 4.3 holds. LetZ∼N(0,I −1 αα·β). Then, for every fixedA <∞andc <∞, lim n→∞ sup ∥h∥≤c En,h h A∧nρ ˆµn, µn,h 2i −E[A∧ ∥Z∥ 2] = 0.(27) Consequently, the profile MLE attains the local asymptotic minimax bound for every truncated squared geodesic loss. Additionally, i
- background staying on the water surface and we use Dijkstra's algorithm [72] to find the shortest path. Firefighting and rescue boats in Germany must comply with German standard DIN 14961 [ 75], defining its technical requirements. Of the various boat models, we selected the highest maximum speed we could find, 70 kilometers per hour for an upgraded high-tech boat [ 76], as a reference speed to finally compute boat travel times ¯δw,τ . Note that this is a very optimistic estimate, as most lifeboats with eq
authors
co-cited works
representative citing papers
MapReason-OSM supplies 6000 graph-verifiable instances across 12 mobility tasks on rendered OSM maps from 10 U.S. downtowns and shows that seven VLMs succeed at simple routing but perform near chance on cost-based facility placement and cross-zoom consistency.
Direct fixed-weight solver for free-support Wasserstein medians relocates atoms using OT barycentric projections and inverse-distance weights, achieving monotone descent on smoothed objectives with fewer subproblems than nested Weiszfeld baselines.
OSCAR learns class-conditioned survival distributions for obstacle clearance times online (handling right-censored data) to compute patience thresholds in graph-based navigation, converging near oracle performance after few observations per class.
Proposes a scale-calibrated median-of-means estimator for robust aggregation of distributed PCA estimates on the product of Euclidean space and Grassmann manifold.
An exact ILP models the combined capacitated subnetwork design and dynamic shortest-path routing problem, with experiments showing that fixing routes first and deactivating unused links yields near-optimal solutions.
An intrinsic effective sample size for manifold MCMC is defined via kernel discrepancy as the number of independent draws yielding equivalent expected squared discrepancy to the target.
The profile maximum likelihood estimator for the location in anisotropic hyperbolic wrapped normal models is strongly consistent, asymptotically normal, and attains the Hájek-Le Cam minimax lower bound under squared geodesic loss.
Finite mixture modeling with Riemannian Gaussian distributions on hyperbolic space is developed, including derivations of the density and exact/generalized EM algorithms with theoretical guarantees for estimation and clustering.
A 1825 storm created a new sea connection in Denmark, producing a 27 percent population increase (elasticity 1.6 to market access) driven by fertility and occupational change toward fishing and manufacturing, with symmetric medieval declines after waterway closure.
DiffSlack introduces learnable slack variables and a damped Gauss-Newton projection to create a differentiable layer that enforces hard nonlinear inequality constraints in neural network outputs.
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.
Pore-scale DNS shows intermittency as a network-coupled process of drainage-imbibition cycles that enhances overall fluid mobility and produces the sub-linear macroscopic scaling regime.
Joint location-scale minimization for geometric medians on product manifolds degenerates to marginal medians, and three new scale-selection methods restore identifiability with asymptotic guarantees.
Reformulating DP as GPU kernels delivers 100- to 100,000-fold speedups for stochastic vehicle routing and inventory problems, enabling much larger scenario sets and stronger first-stage decisions.
Semi-automatic method corrects topological artifacts in 3D tubular skeletons using component-wise MST and filtered Delaunay triangulation from minimal user input.
A review reframing density estimation as 'density evolution' across scales, linking kernel smoothing to heat flow, mixtures to compression, and topology to level sets, while stating three structural results on modes, Gaussian semigroups, and log-concavity.
A 3D mechano-geometric multicellular model integrates cell mechanics, irreversible wall growth, and deformable geometry to simulate apical stem-cell-driven plant morphogenesis.
A survey of LLMs for graph computation introduces a role-based taxonomy of executors versus planners and concludes that current models suit simple small-scale tasks but remain unreliable for large-scale exact computation.
A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.
A UAS with YOLO-based swimmer detection and DES simulations reduces drowning rescue response time by a factor of five versus standard operations in tested lake areas.
citing papers explorer
-
From Sequential to Parallel: Reformulating Dynamic Programming as GPU Kernels for Large-Scale Stochastic Combinatorial Optimization
Reformulating DP as GPU kernels delivers 100- to 100,000-fold speedups for stochastic vehicle routing and inventory problems, enabling much larger scenario sets and stronger first-stage decisions.