1664 search results - page 161 / 333 » Distance labeling in graphs |
132
click to vote
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
131
click to vote
SIAMDM
2008
15 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
147
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—In road networks, sensors are deployed sparsely (hundreds of meters apart) to save costs. This makes the existing localization solutions based on the ranging be ineffect...
136
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
135
click to vote
ICPR
2000
IEEE
16 years 5 months ago
2000
IEEE
The segmentation of colored texture images is considered. Either luminance, color, and/or texture features could be used for segmentation. For luminance and color the classes are ...