
Decomposable ProbabilityofSuccess Metrics in Algorithmic Search
Previous studies have used a specific success metric within an algorithm...
read it

Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem
Clustering is the problem of separating a set of objects into groups (ca...
read it

Improving Image Clustering using Sparse Text and the Wisdom of the Crowds
We propose a method to improve image clustering using sparse text and th...
read it

Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithm
We obtain an improved finitesample guarantee on the linear convergence ...
read it

Nearoptimal compressed sensing guarantees for total variation minimization
Consider the problem of reconstructing a multidimensional signal from an...
read it

Blameworthiness in Strategic Games
There are multiple notions of coalitional responsibility. The focus of t...
read it

Lattices from tight frames and vertex transitive graphs
We show that real tight frames that generate lattices must be rational, ...
read it

Designing Perfect Simulation Algorithms using Local Correctness
Consider a randomized algorithm that draws samples exactly from a distri...
read it

Robust estimation of the mean with bounded relative standard deviation
Many randomized approximation algorithms operate by giving a procedure f...
read it

Covering pointsets with parallel hyperplanes and sparse signal recovery
Let S be a set of k > n points in a Euclidean space R^n, n ≥ 1. How many...
read it

Fewer colors for perfect simulation of proper colorings
Given a graph G and color set {1, …, k}, a proper coloring is an assignm...
read it
Claremont McKenna College
Claremont McKenna College is a coeducational, private liberal arts college in Claremont, California.