Pages that link to "Item:Q3192024"

The following pages link to Clustering for edge-cost minimization (extended abstract) (Q3192024):

Displaying 14 items.

• Dimensionality reduction with subgaussian matrices: a unified theory (Q515989) (← links)
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
• A nonlinear approach to dimension reduction (Q894683) (← links)
• Analysis of set-up time models: a metric perspective (Q935161) (← links)
• Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins. (Q1401965) (← links)
• Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders (Q1850474) (← links)
• Geometric component analysis and its applications to data analysis (Q2036489) (← links)
• Correlation clustering in general weighted graphs (Q2503347) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
• Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
• Experiments with a Non-convex Variance-Based Clustering Criterion (Q5270614) (← links)
• (Q5743481) (← links)