In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time. It uses little of the machinery that previouslyâ€¦ (More)

First-order methods play a central role in large-scale machine learning. Even though many variations exist, each suited to a particular problem, almost all such methods fundamentally rely on twoâ€¦ (More)

Given a subset A of vertices of an undirected graph G, the cut-improvement problem asks us to find a subset S that is similar to A but has smaller conductance. An elegant algorithm for this problemâ€¦ (More)

The second eigenvalue of the Laplacian matrix and its associated eigenvector are fundamental features of an undirected graph, and as such they have found widespread use in scientific computing,â€¦ (More)

In this paper, we consider the following graph partitioning problem: The input is an undirected graph <i>G</i> = (<i>V, E</i>), a balance parameter <i>b</i> âˆˆ (0, 1/2] and a target conductance valueâ€¦ (More)

We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the network. Aim of theâ€¦ (More)