The following pages link to Avrim L. Blum (Q1127356):
Displaying 50 items.
- (Q290193) (redirect page) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- Correlation clustering (Q703079) (← links)
- Center-based clustering under perturbation stability (Q763489) (← links)
- Kernels as features: on kernels, margins, and low-dimensional mappings (Q851869) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- Fast learning of \(k\)-term DNF formulas with queries. (Q960515) (← links)
- A theory of learning with similarity functions (Q1009272) (← links)
- Selection of relevant features and examples in machine learning (Q1127357) (← links)
- Rank-\(r\) decision trees are a subclass of \(r\)-decision lists (Q1198056) (← links)
- Learning Boolean functions in an infinite attribute space (Q1206444) (← links)
- (Q1271189) (redirect page) (← links)
- A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
- Learning with unreliable boundary queries (Q1271553) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- Learning an intersection of a constant number of halfspaces over a uniform distribution (Q1356892) (← links)
- A note on learning from multiple-instance examples (Q1383191) (← links)
- Microchoice bounds and self bounding learning algorithms (Q1394783) (← links)
- Static optimality and dynamic search-optimality in lists and trees (Q1400896) (← links)
- Fast planning through planning graph analysis (Q1402751) (← links)
- On-line learning and the metrical task system problem (Q1568389) (← links)
- Learning in the presence of finitely or infinitely many irrelevant attributes (Q1892203) (← links)
- Separating populations with wide data: a spectral analysis (Q1951968) (← links)
- Universal portfolios with and without transaction costs. (Q1964324) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Foundations of data science (Q2035068) (← links)
- Lifelong learning in costly feature spaces (Q2290680) (← links)
- Computing Stackelberg equilibria of large general-sum games (Q2292620) (← links)
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (Q2706128) (← links)
- The minimum latency problem (Q2817608) (← links)
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616) (← links)
- Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior (Q2839178) (← links)
- Fast Private Data Release Algorithms for Sparse Queries (Q2851873) (← links)
- (Q2921789) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- (Q3002759) (← links)
- (Q3002785) (← links)
- (Q3002821) (← links)
- (Q3093198) (← links)
- On Nash-Equilibria of Approximation-Stable Games (Q3162509) (← links)
- Additive Approximation for Near-Perfect Phylogeny Construction (Q3167382) (← links)
- (Q3174120) (← links)
- Online algorithms for market clearing (Q3455219) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- A Theory of Similarity Functions for Learning and Clustering (Q3520043) (← links)
- (Q3524713) (← links)
- Clustering with Interactive Feedback (Q3529931) (← links)
- (Q3549721) (← links)
- A discriminative model for semi-supervised learning (Q3578199) (← links)
