We propose a framework for analyzing and comparing distributions, which we use to
construct statistical tests to determine if two samples are drawn from different distributions …

A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

We propose two statistical tests to determine if two samples are from different distributions.
Our test statistic is in both cases the distance between the means of the two samples …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

Interior point algorithms for solving linear programs have been studied extensively for a long
time [eg Karmarkar 1984; Lee, Sidford FOCS'14; Cohen, Lee, Song STOC'19]. For linear …

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

Borůvka presented in 1926 the first solution of the Minimum Spanning Tree Problem (MST)
which is generally regarded as a cornerstone of Combinatorial Optimization. In this paper …

In this work, we extend a common framework for graph-based image segmentation that
includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing …

The design of approximation algorithms for spanning tree problems has become an exciting
and important area of theoretical computer science and also plays a significant role in …