Sciweavers

829 search results - page 155 / 166
» Distance domination-critical graphs
Sort
View
ADHOCNOW
2008
Springer
14 years 10 months ago
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
Jean-Claude Bermond, Min-Li Yu
AHSWN
2010
105views more  AHSWN 2010»
14 years 9 months ago
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
Jean-Claude Bermond, Min-Li Yu
102
Voted
CVIU
2008
141views more  CVIU 2008»
14 years 9 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon
DM
2008
73views more  DM 2008»
14 years 9 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
CORR
2006
Springer
93views Education» more  CORR 2006»
14 years 9 months ago
Multirobot rendezvous with visibility sensors in nonconvex environments
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
Anurag Ganguli, Jorge Cortés, Francesco Bul...