Applications

Convergent Bounds on the Euclidean Distance NeurIPS 2011 Exploiting spatial overlap to efficiently compute appearance distances between image windows NeurIPS 2011 Generative Modeling for Maximizing Precision and Recall in Information Visualization AISTATS 2011 Hashing Algorithms for Large-Scale Learning NeurIPS 2011 ICA with Reconstruction Cost for Efficient Overcomplete Feature Learning NeurIPS 2011 Learning a Robust Relevance Model for Search Using Kernel Methods JMLR 2011 On NDCG Consistency of Listwise Ranking Methods AISTATS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 Recovering Intrinsic Images with a Global Sparsity Prior on Reflectance NeurIPS 2011 Scikit-learn: Machine Learning in Python JMLR 2011 Support Vector Machines Under Adversarial Label Noise ACML 2011 Waffles: A Machine Learning Toolkit JMLR 2011 A VLSI Implementation of the Adaptive Exponential Integrate-and-Fire Neuron Model NeurIPS 2010 Half Transductive Ranking AISTATS 2010 Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development NeurIPS 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Predicting Execution Time of Computer Programs Using Sparse Polynomial Regression NeurIPS 2010 Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010 Static Analysis of Binary Executables Using Structural SVMs NeurIPS 2010 Subgraph Detection Using Eigenvector L1 Norms NeurIPS 2010 Throttling Poisson Processes NeurIPS 2010 Two-Layer Generalization Analysis for Ranking Using Rademacher Average NeurIPS 2010 WEKA−Experiences with a Java Open-Source Project JMLR 2010 Adapting to the Shifting Intent of Search Queries NeurIPS 2009 A Gaussian Tree Approximation for Integer Least-Squares NeurIPS 2009