Pages that link to "Item:Q633202"

The following pages link to Relative \((p,\varepsilon )\)-approximations in geometry (Q633202):

Displaying 20 items.

• Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
• Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
• Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
• Two proofs for shallow packings (Q728497) (← links)
• Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
• Shape matching under rigid motion (Q1947970) (← links)
• Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
• Percolation centrality via Rademacher Complexity (Q2091801) (← links)
• Digital almost nets (Q2112558) (← links)
• Optimal approximations made easy (Q2122796) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
• (Q5075824) (← links)
• Smallest k-enclosing rectangle revisited (Q5088950) (← links)
• Journey to the Center of the Point Set (Q5088971) (← links)
• (Q5088989) (← links)
• (Q5115770) (← links)
• A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs (Q6075716) (← links)