The following pages link to Nir Ailon (Q284582):
Displaying 48 items.
- Tight lower bound instances for \(k\)-means++ in two dimensions (Q284583) (← links)
- Bandit online optimization over the permutahedron (Q329616) (← links)
- Dense fast random projections and Lean Walsh transforms (Q629831) (← links)
- Information theory in property testing and monotonicity testing in higher dimension (Q859828) (← links)
- Property-preserving data reconstruction (Q930593) (← links)
- Fast dimension reduction using Rademacher series on dual BCH codes (Q1042451) (← links)
- Preference-based learning to rank (Q1959596) (← links)
- Deep metric learning using triplet network (Q2027237) (← links)
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
- Approximate correlation clustering using same-cluster queries (Q2294677) (← links)
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921) (← links)
- Fast and RIP-optimal transforms (Q2514234) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model (Q2828217) (← links)
- Learning and Optimizing with Preferences (Q2859203) (← links)
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (Q2931418) (← links)
- An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform (Q2933651) (← links)
- (Q2934012) (← links)
- (Q2934621) (← links)
- Bandit Online Optimization over the Permutahedron (Q2938734) (← links)
- Self-Improving Algorithms (Q3020010) (← links)
- Improved Approximation Algorithms for Bipartite Correlation Clustering (Q3092214) (← links)
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny (Q3115867) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- On Clusters in Markov Chains (Q3525746) (← links)
- Dense Fast Random Projections and Lean Walsh Transforms (Q3541816) (← links)
- (Q3579390) (← links)
- Self-improving algorithms (Q3581488) (← links)
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems (Q3638021) (← links)
- (Q4614094) (← links)
- Torsion points on curves and common divisors of a<sup>k</sup>-1 and b<sup>k</sup>-1 (Q4811239) (← links)
- Improved Approximation Algorithms for Bipartite Correlation Clustering (Q4907577) (← links)
- Approximate Clustering with Same-Cluster Queries (Q4993306) (← links)
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors (Q5189547) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313026) (← links)
- (Q5365036) (← links)
- (Q5405112) (← links)
- A Tight Lower Bound Instance for k-means++ in Constant Dimension (Q5410631) (← links)
- (Q5414631) (← links)
- Estimating the distance to a monotone function (Q5433267) (← links)
- (Q5502120) (← links)
- STACS 2005 (Q5710696) (← links)
- Algorithms and Computation (Q5712134) (← links)
- Aggregating inconsistent information (Q5899505) (← links)
- Lower bounds for linear degeneracy testing (Q5900514) (← links)
- Lower bounds for linear degeneracy testing (Q5901076) (← links)
- Aggregating inconsistent information (Q5901110) (← links)
