Sciweavers

836 search results - page 117 / 168
» Orthogonal Colorings of Graphs
Sort
View
CVGIP
2004
98views more  CVGIP 2004»
15 years 1 months ago
Topological volume skeletonization and its application to transfer function design
Topological volume skeletonization is a novel approach for automating transfer function design in visualization by extracting the topological structure of a volume dataset. The sk...
Shigeo Takahashi, Yuriko Takeshima, Issei Fujishir...
126
Voted
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 5 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 1 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy
COCOON
2007
Springer
15 years 8 months ago
On the Number of Cycles in Planar Graphs
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
Kevin Buchin, Christian Knauer, Klaus Kriegel, And...
ICIP
2008
IEEE
15 years 8 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao