2304 search results - page 340 / 461 » On the Vulnerability of Large Graphs |
CASCON
2003
14 years 11 months ago
2003
The development of large software systems involves a continual lengthy build process that may include preprocessing, compilation and linking of tens of thousands of source code ï¬...
NIPS
2004
14 years 11 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
NIPS
2004
14 years 11 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Previous approaches for mining association rules generate large sets of association rules. Such sets are difficult for users to understand and manage. Here, the concept of a restri...
AAAI
1998
14 years 11 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...