Sciweavers

588 search results - page 73 / 118
» Rendezvous without coordinates
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
IROS
2009
IEEE
166views Robotics» more  IROS 2009»
15 years 6 months ago
Independent navigation of multiple mobile robots with hybrid reciprocal velocity obstacles
Abstract— We present an approach for smooth and collisionfree navigation of multiple mobile robots amongst each other. Each robot senses its surroundings and acts independently w...
Jamie Snape, Jur P. van den Berg, Stephen J. Guy, ...
FIMH
2009
Springer
15 years 6 months ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...
COMSWARE
2008
IEEE
15 years 6 months ago
Network coding for TCP throughput enhancement over a multi-hop wireless network
—The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance...
P. Samuel David, Anurag Kumar
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 6 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan