Abstract— We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate ou...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
In this paper we propose the use of small global memory for a viewer’s immediate surroundings to assist in recognising places that have been visited previously. We call this glob...
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
A web application is presented to compute, plot, and interactively explore planar arrangements induced by algebraic plane curves of arbitrary degree. It produces accurate curve pl...
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...