—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...
Abstract. We present a set of gradient based orthogonal and nonorthogonal matrix joint diagonalization algorithms. Our approach is to use the geometry of matrix Lie groups to devel...