Sciweavers

1370 search results - page 75 / 274
» On grids in topological graphs
Sort
View
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 3 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
WWW
2004
ACM
16 years 16 days ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
SG
2005
Springer
15 years 5 months ago
Automatic Cross-Sectioning Based on Topological Volume Skeletonization
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
Yuki Mori, Shigeo Takahashi, Takeo Igarashi, Yurik...
93
Voted
AMAI
2000
Springer
15 years 4 months ago
Using topology for spatial reasoning
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
Boi Faltings
ICCV
2011
IEEE
13 years 12 months ago
Robust Topological Features for Deformation Invariant Image Matching
Local photometric descriptors are a crucial low level component of numerous computer vision algorithms. In practice, these descriptors are constructed to be invariant to a class o...
Edgar Lobaton, Ramanarayan Vasudevan, Ron Alterovi...