Sciweavers

1370 search results - page 116 / 274
» On grids in topological graphs
Sort
View
TIT
1998
127views more  TIT 1998»
15 years 6 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
INFOCOM
2007
IEEE
16 years 1 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
INFOCOM
2005
IEEE
16 years 21 days ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
3DIM
2003
IEEE
16 years 12 days ago
A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...
Yijun Xiao, Paul Siebert, Naoufel Werghi
GD
2008
Springer
15 years 8 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril