IJCM
2002
13 years 11 months ago
2002
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
SMA
2008
ACM
13 years 11 months ago
2008
ACM
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
IMAGING
2003
14 years 24 days ago
2003
Typical color image processing techniques use profiles consisting of sparse multi-dimensional lookup tables that interpolate between adjacent nodes to prepare an image for renderi...
GD
2005
Springer
14 years 5 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
LCN
2008
IEEE
14 years 5 months ago
2008
IEEE
—In vehicular ad-hoc networks (VANETs), mobility is one of key characteristics that have a significant effect on routing performance because it causes dynamic changes of network...
PERCOM
2006
ACM
14 years 11 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...