The following pages link to Sanjoy Dasgupta (Q439995):
Displaying 28 items.
- A tree-based regressor that adapts to intrinsic dimension (Q439996) (← links)
- The sample complexity of learning fixed-structure Bayesian networks (Q1380858) (← links)
- A theoretical analysis of query selection for collaborative filtering (Q1394791) (← links)
- Performance guarantees for hierarchical clustering (Q1780451) (← links)
- Randomized partition trees for nearest neighbor search (Q2345949) (← links)
- Two faces of active learning (Q2431424) (← links)
- (Q2880883) (← links)
- Consistent Procedures for Cluster Tree Estimation and Pruning (Q2979179) (← links)
- (Q3046717) (← links)
- (Q3174072) (← links)
- The complexity of approximating entropy (Q3579192) (← links)
- (Q4420761) (← links)
- (Q4558500) (← links)
- A neural algorithm for a fundamental computing problem (Q4645996) (← links)
- An elementary proof of a theorem of Johnson and Lindenstrauss (Q4798181) (← links)
- Random Projection Trees for Vector Quantization (Q4975927) (← links)
- Nearest Neighbor Classification and Search (Q5027284) (← links)
- Habituation as a neural algorithm for online odor discrimination (Q5073072) (← links)
- (Q5088926) (← links)
- (Q5091718) (← links)
- A neural data structure for novelty detection (Q5222821) (← links)
- (Q5302077) (← links)
- Learning Theory and Kernel Machines (Q5305857) (← links)
- A cost function for similarity-based hierarchical clustering (Q5361823) (← links)
- On-Line Estimation with the Multivariate Gaussian Distribution (Q5434056) (← links)
- Learning Theory (Q5473614) (← links)
- The Complexity of Approximating the Entropy (Q5700573) (← links)
- (Q5867279) (← links)
