conftrace_
← Computer Science
Computer Science ›

Foundations

1,623 papers (0 classified directly here)

Subtopics

Algorithms (1,298) Graph Theory (190) Formal Languages (113) Programming Languages (46) Data Structures (39)

Papers per year

1
7
34
188
122
'05
'10
'15
'20
'25

Papers (including subtopics)

Algorithms and hardness results for parallel large margin learning NIPS 2011
Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NIPS 2011
Randomized Algorithms for Comparison-based Search NIPS 2011
Multiple Instance Learning on Structured Data NIPS 2011
Learning to Search Efficiently in High Dimensions NIPS 2011
Reconstructing Patterns of Information Diffusion from Incomplete Observations NIPS 2011
A New Algorithm for Compressed Counting with Applications in Shannon Entropy Estimation in Dynamic Data COLT 2011
Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D RSS 2011
b-Bit Minwise Hashing for Estimating Three-Way Similarities NIPS 2010
Link Discovery using Graph Feature Tracking NIPS 2010
Random Projection Trees Revisited NIPS 2010
Efficient Minimization of Decomposable Submodular Functions NIPS 2010
Single versus Multiple Sorting in All Pairs Similarity Search ACML 2010
Learning the Structure of Deep Sparse Graphical Models AISTATS 2010
A Molecular Algorithm for Path Self-Assembly in 3 Dimensions RSS 2010
Fast subtree kernels on graphs NIPS 2009
Linear-time Algorithms for Pairwise Statistical Problems NIPS 2009
Streaming k-means approximation NIPS 2009
Noisy Generalized Binary Search NIPS 2009
A Game-Theoretic Approach to Hypergraph Clustering NIPS 2009
Exponential Family Graph Matching and Ranking NIPS 2009
Locality-sensitive binary codes from shift-invariant kernels NIPS 2009
Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NIPS 2009
Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NIPS 2009
An Integer Projected Fixed Point Method for Graph Matching and MAP Inference NIPS 2009