We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
— In this note, we present initial results towards developing a distributed algorithm for repairing topological holes in the sensor cover of a mobile robot team. Central to our a...
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...