output
20002026
most citedUsing Bad Learners to find Good Configurations

123 citations

Showing 2018Show all

28 papers · 1 filter

eess.SY2018★ 5 cited

Derandomized Distributed Multi-resource Allocation with Little Communication Overhead

Syed Eqbal Alam, Robert Shorten, Fabian Wirth +1

We study a class of distributed optimization problems for multiple shared resource allocation in Internet-connected devices. We propose a derandomized version of an existing stocha…

eess.SY2018★ 9 cited

Distributed Algorithms for Internet-of-Things-enabled Prosumer Markets: A Control Theoretic Perspective

Syed Eqbal Alam, Robert Shorten, Fabian Wirth +1

Internet-of-Things (IoT) enables the development of sharing economy applications. In many sharing economy scenarios, agents both produce as well as consume a resource; we call them…

math.OC2018★ 7 cited

On the relation between topological entropy and restoration entropy

Christoph Kawan

In the context of state estimation under communication constraints, several notions of dynamical entropy play a fundamental role, among them: topological entropy and restoration en…

cs.CV2018

Incremental Scene Synthesis

Benjamin Planche, Xuejian Rong, Ziyan Wu +5

We present a method to incrementally generate complete 2D or 3D scenes with the following properties: (a) it is globally consistent at each step according to a learned scene prior,…

eess.SY2018

Stability analysis of networked control systems with not necessarily UGES protocols

Seyed Hossein Mousavi, Navid Noroozi, Anton H. J. de Ruiter +1

This note studies (practical) asymptotic stability of nonlinear networked control systems whose protocols are not necessarily uniformly globally exponentially stable. In particular…

math.NA2018

SVD update methods for large matrices and applications

Juan Manuel Peña, Tomas Sauer

We consider the problem of updating the SVD when augmenting a "tall thin" matrix, i.e., a rectangular matrix $A \in \RR^{m \times n}$ with . Supposing that an SVD of i…