3008 search results - page 107 / 602 » Independence in connected graphs |
153
click to vote
IWANN
2007
Springer
16 years 15 days ago
2007
Springer
This paper presents a network architecture to interconnect mixed-signal VLSI1 integrate-and-fire neural networks in a way that the timing of the neural network data is preserved. ...
145
click to vote
SSS
2007
Springer
16 years 14 days ago
2007
Springer
In this paper we present a rigorous treatment to structured overlay maintenance in decentralized peerto-peer (P2P) systems subject to various system and network failures. we prese...
133
click to vote
OPODIS
2004
15 years 7 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
158
click to vote
ACIVS
2008
Springer
16 years 22 days ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
160
click to vote
AAAI
2007
15 years 8 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...