1972 search results - page 96 / 395 » connection 2008 |
126
click to vote
IPL
2007
15 years 5 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
156
Voted
TIT
2008
15 years 5 months ago
2008
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
131
click to vote
TIT
2008
15 years 5 months ago
2008
For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is chara...
123
click to vote
TOG
2008
15 years 5 months ago
2008
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
137
Voted
DAM
2002
15 years 5 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...