2304 search results - page 325 / 461 » On the Vulnerability of Large Graphs |
163
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
139
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
182
click to vote
CVIU
2008
15 years 6 months ago
2008
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
173
click to vote
JDA
2006
15 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
150
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Most search techniques within ILP require the evaluation of a large number of inconsistent clauses. However, acceptable clauses typically need to be consistent, and are only found ...