Sciweavers

1986 search results - page 135 / 398
» Path Separability of Graphs
Sort
View
JUCS
2010
142views more  JUCS 2010»
13 years 7 months ago
Mobile Agent Routing with Time Constraints: A Resource Constrained Longest-Path Approach
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
Eduardo Camponogara, Ricardo Boveto Shima
EJWCN
2010
115views more  EJWCN 2010»
13 years 3 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
PAMI
2010
188views more  PAMI 2010»
13 years 3 months ago
Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
DCC
2007
IEEE
14 years 8 months ago
Distributed Functional Compression through Graph Coloring
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
ICDCSW
2009
IEEE
14 years 3 months ago
Dynamic TCP Proxies: Coping with Disadvantaged Hosts in MANETs
Applications in mobile ad-hoc networks can suffer from poor link quality and degraded network services. In particular, standard TCP over low-quality, long routing paths, can have ...
Tu Ouyang, Shudong Jin, Michael Rabinovich