— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...