Sciweavers

2716 search results - page 358 / 544
» Computational Topology for Shape Modeling
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
TCP Network Calculus: The case of large delay-bandwidth product
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...
COSIT
2001
Springer
142views GIS» more  COSIT 2001»
15 years 11 months ago
The Utility of Global Representations in a Cognitive Map
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...
Margaret E. Jefferies, Wai K. Yeap
COMPGEOM
2010
ACM
15 years 11 months ago
Constructing Reeb graphs using cylinder maps
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 ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
COMPGEOM
2008
ACM
15 years 8 months ago
Visualizing and exploring planar algebraic arrangements: a web application
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...
Pavel Emeliyanenko, Michael Kerber
ICRA
2005
IEEE
115views Robotics» more  ICRA 2005»
16 years 3 days ago
An Interpolated Dynamic Navigation Function
— 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 ...
Roland Philippsen, Roland Siegwart