NIPS Proceedingsβ

Andrew W. Moore

23 Papers

  • A Bayesian Spatial Scan Statistic (2005)
  • Dual-Tree Fast Gauss Transforms (2005)
  • Dynamic Social Network Analysis using Latent Space Models (2005)
  • Fast Information Value for Graphical Models (2005)
  • Variable KD-Tree Algorithms for Spatial Pattern Search and Discovery (2005)
  • Active Learning for Anomaly and Rare-Category Detection (2004)
  • An Investigation of Practical Approximate Nearest Neighbor Algorithms (2004)
  • Detecting Significant Multidimensional Spatial Clusters (2004)
  • A Fast Multi-Resolution Method for Detection of Significant Spatial Disease Clusters (2003)
  • New Algorithms for Efficient High Dimensional Non-parametric Classification (2003)
  • Using Tarjan's Red Rule for Fast Dependency Tree Construction (2002)
  • `N-Body' Problems in Statistical Learning (2000)
  • Barycentric Interpolators for Continuous Space and Time Reinforcement Learning (1998)
  • Gradient Descent for General Reinforcement Learning (1998)
  • Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees (1998)
  • Memory-based Stochastic Optimization (1995)
  • Generalization in Reinforcement Learning: Safely Approximating the Value Function (1994)
  • Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation (1993)
  • Memory-Based Methods for Regression and Classification (1993)
  • The Parti-Game Algorithm for Variable Resolution Reinforcement Learning in Multidimensional State-Spaces (1993)
  • Memory-Based Reinforcement Learning: Efficient Computation with Prioritized Sweeping (1992)
  • Fast, Robust Adaptive Control by Learning only Forward Models (1991)
  • A VLSI Neural Network for Color Constancy (1990)