This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
– We present a robust localization algorithm for mobile robots with laser range finders, which takes featurebased approach for reliable matching process as well as pointbased app...
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
In this paper, we explore a privacy algorithm that detects human private parts in a 3D scan data set. The analogia graph is introduced to study the proportion of structures. The i...