Computer Science

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 Game-Theoretic Approach to Hypergraph Clustering NeurIPS 2009 A Gaussian Tree Approximation for Integer Least-Squares NeurIPS 2009 An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NeurIPS 2009 Complexity of Decentralized Control: Special Cases NeurIPS 2009 Constructing Topological Maps using Markov Random Fields and Loop-Closure Detection NeurIPS 2009 Efficient Bregman Range Search NeurIPS 2009 Exponential Family Graph Matching and Ranking NeurIPS 2009 Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection JMLR 2009 Fast subtree kernels on graphs NeurIPS 2009 Improving Existing Fault Recovery Policies NeurIPS 2009 Java-ML: A Machine Learning Library JMLR 2009 Lattice Regression NeurIPS 2009 Learning to Hash with Binary Reconstructive Embeddings NeurIPS 2009 Learning to Rank by Optimizing NDCG Measure NeurIPS 2009 Linear-time Algorithms for Pairwise Statistical Problems NeurIPS 2009 Locality-sensitive binary codes from shift-invariant kernels NeurIPS 2009 Localizing Bugs in Program Executions with Graphical Models NeurIPS 2009 Local Rules for Global MAP: When Do They Work ? NeurIPS 2009 Matrix Completion from Power-Law Distributed Samples NeurIPS 2009 Maximum likelihood trajectories for continuous-time Markov chains NeurIPS 2009 Modeling Social Annotation Data with Content Relevance using a Topic Model NeurIPS 2009 Noisy Generalized Binary Search NeurIPS 2009