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)

Query Complexity of Derivative-Free Optimization NIPS 2012
One Permutation Hashing NIPS 2012
Perceptron Learning of SAT NIPS 2012
A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012
Learning and Model-Checking Networks of I/O Automata ACML 2012
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem COLT 2012
(weak) Calibration is Computationally Hard COLT 2012
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012
Learning Functions of Halfspaces Using Prefix Covers COLT 2012
Computational Bounds on Statistical Query Learning COLT 2012
Tight Bounds on Proper Equivalence Query Learning of DNF COLT 2012
DEAP: Evolutionary Algorithms Made Easy JMLR 2012
Extrinsic Calibration from Per-Sensor Egomotion RSS 2012
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound NIPS 2011
Phase transition in the family of p-resistances NIPS 2011
Hashing Algorithms for Large-Scale Learning NIPS 2011
Nonstandard Interpretations of Probabilistic Programs for Efficient Inference NIPS 2011
Nearest Neighbor based Greedy Coordinate Descent NIPS 2011
Convergent Bounds on the Euclidean Distance NIPS 2011
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Data Skeletonization via Reeb Graphs NIPS 2011
Fast and Accurate k-means For Large Datasets NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
See the Tree Through the Lines: The Shazoo Algorithm NIPS 2011