Sciweavers

625 search results - page 57 / 125
» Topologically Adaptable Snakes
Sort
View
MSWIM
2005
ACM
14 years 4 months ago
Hop distances and flooding in wireless multihop networks with randomized beamforming
We show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small an...
Robert Vilzmann, Christian Bettstetter, Daniel Med...
EMMCVPR
2003
Springer
14 years 4 months ago
Surface Recovery from 3D Point Data Using a Combined Parametric and Geometric Flow Approach
This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper...
Peter Savadjiev, Frank P. Ferrie, Kaleem Siddiqi
CONEXT
2007
ACM
14 years 3 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt
JCP
2007
121views more  JCP 2007»
13 years 11 months ago
Learning by Discrimination: A Constructive Incremental Approach
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
Christophe G. Giraud-Carrier, Tony R. Martinez
OSDI
2008
ACM
14 years 11 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...