Skip to content
conftrace_

Algorithms

1,701 papers

1
8
38
163
200
'5
'10
'15
'20
'25

Papers

Unsupervised Spectral Learning of Finite State Transducers NeurIPS 2013 Wavelets on Graphs via Deep Learning NeurIPS 2013 What is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? ICCV 2013 When in Doubt, SWAP: High-Dimensional Sparse Recovery from Correlated Measurements NeurIPS 2013 Which Space Partitioning Tree to Use for Search? NeurIPS 2013 A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012 A Linear Time Active Learning Algorithm for Link Classification NeurIPS 2012 A Polylog Pivot Steps Simplex Algorithm for Classification NeurIPS 2012 A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound NeurIPS 2012 Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012 Computational Bounds on Statistical Query Learning COLT 2012 CPRL -- An Extension of Compressive Sensing to the Phase Retrieval Problem NeurIPS 2012 DEAP: Evolutionary Algorithms Made Easy JMLR 2012 Efficient Sampling for Bipartite Matching Problems NeurIPS 2012 Entropy Estimations Using Correlated Symmetric Stable Random Projections NeurIPS 2012 Extrinsic Calibration from Per-Sensor Egomotion RSS 2012 Fast Resampling Weighted v-Statistics NeurIPS 2012 Feature Clustering for Accelerating Parallel Coordinate Descent NeurIPS 2012 Forward-Backward Activation Algorithm for Hierarchical Hidden Markov Models NeurIPS 2012 Learning Functions of Halfspaces Using Prefix Covers COLT 2012 Multiresolution analysis on the symmetric group NeurIPS 2012 Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison NeurIPS 2012 One Permutation Hashing NeurIPS 2012 Perceptron Learning of SAT NeurIPS 2012 Query Complexity of Derivative-Free Optimization NeurIPS 2012