Pages that link to "Item:Q1262767"

The following pages link to Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767):

Displaying 37 items.

• Continuum limit of total variation on point clouds (Q261295) (← links)
• A variational approach to the consistency of spectral clustering (Q723005) (← links)
• A provably efficient algorithm for dynamic storage allocation (Q756873) (← links)
• Transport inequalities on Euclidean spaces for non-Euclidean metrics (Q785902) (← links)
• Gravitational allocation to Poisson points (Q990185) (← links)
• The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
• Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
• Constructions of majorizing measures, Bernoulli processes and cotype (Q1343333) (← links)
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH (Q1774522) (← links)
• Properly-weighted graph Laplacian for semi-supervised learning (Q2019913) (← links)
• A simple Fourier analytic proof of the AKT optimal matching theorem (Q2075321) (← links)
• On the quadratic random matching problem in two-dimensional domains (Q2136099) (← links)
• On the spectrum of dense random geometric graphs (Q2170358) (← links)
• Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator (Q2194775) (← links)
• Gravitational allocation for uniform points on the sphere (Q2227716) (← links)
• On optimal matching of Gaussian samples (Q2313798) (← links)
• Dilation bootstrap (Q2448413) (← links)
• Monotone properties of random geometric graphs have sharp thresholds (Q2496499) (← links)
• The spectrum of a random geometric graph is concentrated (Q2641416) (← links)
• Optimal Cheeger cuts and bisections of random geometric graphs (Q2657914) (← links)
• Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle (Q3301809) (← links)
• Exact Bounds for the Stochastic Upward Matching Problem (Q3806444) (← links)
• Exact Bounds for the Stochastic Upward Matching Problem (Q3808933) (← links)
• Optimal Matching and Empirical Measures (Q4206152) (← links)
• Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures (Q4292711) (← links)
• Average-case analyses of first fit and random fit bin packing (Q4487093) (← links)
• Linear waste of best fit bin packing on skewed distributions (Q4537630) (← links)
• (Q4638245) (← links)
• Analysis of $p$-Laplacian Regularization in Semisupervised Learning (Q5231303) (← links)
• On the rate of convergence of empirical measure in $\infty $-Wasserstein distance for unbounded density function (Q5233999) (← links)
• Belief Propagation for MiniMax Weight Matching (Q5356967) (← links)
• Analysis of Stochastic Online Bin Packing Processes (Q5462796) (← links)
• Bin Packing with Queues (Q5504150) (← links)
• Ollivier curvature of random geometric graphs converges to Ricci curvature of their Riemannian manifolds (Q6050219) (← links)
• Decomposing Random Permutations into Order-Isomorphic Subpermutations (Q6161260) (← links)
• Long range order for random field Ising and Potts models (Q6180706) (← links)
• Modeling self-aggregation of stochastic particles: a \(\Gamma\)-convergence approach (Q6633032) (← links)