1370 search results - page 54 / 274 » On grids in topological graphs |
CCCG
2007
15 years 1 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
107
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
111
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
102
click to vote
ISI
2007
Springer
14 years 11 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
117
click to vote
ICML
1995
IEEE
16 years 19 days ago
1995
IEEE
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...