The following pages link to Lee-Ad J. Gottlieb (Q814924):
Displayed 38 items.
- Item:Q814924 (redirect page) (← links)
- Optimizing budget allocation for center and median points (Q265070) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
- Efficient data storage in large nanoarrays (Q814927) (← links)
- Apportioned margin approach for cost sensitive large margin classifiers (Q825011) (← links)
- A nonlinear approach to dimension reduction (Q894683) (← links)
- Strong stability preserving properties of Runge--Kutta time discretization methods for linear constant coefficient operators (Q1403973) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Non-uniform packings (Q2059874) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- Approximate nearest neighbor search for \(\ell_p\)-spaces \((2<p<\infty)\) via embeddings (Q2294683) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Adaptive Metric Dimensionality Reduction (Q2859224) (← links)
- Searching dynamic point sets in spaces with bounded doubling dimension (Q2931420) (← links)
- Efficient Classification for Metric Data (Q2986185) (← links)
- (Q3132849) (← links)
- An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109) (← links)
- (Q3579450) (← links)
- Dictionary matching and indexing with errors and don't cares (Q3580961) (← links)
- Proximity Algorithms for Nearly-Doubling Spaces (Q3588407) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp (Q4635528) (← links)
- Light spanners for Snowflake Metrics (Q4635563) (← links)
- Learning Convex Polyhedra With Margin (Q5080039) (← links)
- Labelings vs. Embeddings: On Distributed Representations of Distances (Q5146836) (← links)
- (Q5361299) (← links)
- (Q5365085) (← links)
- (Q5365088) (← links)
- Efficient Regression in Metric Spaces via Approximate Lipschitz Extension (Q5369840) (← links)
- Near-Optimal Sample Compression for Nearest Neighbors (Q5375566) (← links)
- Proximity Algorithms for Nearly Doubling Spaces (Q5408590) (← links)
- The traveling salesman problem (Q5415508) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- Adaptive metric dimensionality reduction (Q5964069) (← links)
- Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces (Q6065229) (← links)
- Labelings vs. embeddings: on distributed and prioritized representations of distances (Q6124827) (← links)
- Functions with average smoothness: structure, algorithms, and learning (Q6344957) (← links)
- Non-uniform packings (Q6346472) (← links)