In this paper, we study the problem of reconstructing the polyhedral structures and geometric positions of a general nD polyhedral scene from a single 2D line drawing. With the ide...
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...