2304 search results - page 93 / 461 » On the Vulnerability of Large Graphs |
117
click to vote
IJCAI
2003
15 years 3 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
221
click to vote
ASUNAM
2011
IEEE
14 years 1 months ago
2011
IEEE
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...
128
click to vote
SP
2008
IEEE
15 years 8 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
124
Voted
WG
2010
Springer
14 years 12 months ago
2010
Springer
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
116
click to vote
STOC
2005
ACM
16 years 1 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...