Sciweavers

1067 search results - page 102 / 214
» Probabilistic regular graphs
Sort
View
JNSM
2008
93views more  JNSM 2008»
15 years 3 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
JGAA
2007
135views more  JGAA 2007»
15 years 3 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
JMIV
2008
97views more  JMIV 2008»
15 years 3 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...
ICASSP
2011
IEEE
14 years 6 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
COCOON
2005
Springer
15 years 8 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...