2304 search results - page 265 / 461 » On the Vulnerability of Large Graphs |
177
click to vote
PPAM
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
162
click to vote
WADS
2007
Springer
16 years 22 days ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
136
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
161
click to vote
ICRA
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
183
click to vote
VALUETOOLS
2006
ACM
16 years 17 days ago
2006
ACM
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...