33 search results - page 1 / 7 » Graph Matching using Adjacency Matrix Markov Chains |
BMVC
2001
13 years 7 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
TIFS
2010
13 years 3 months ago
2010
This paper presents a novel method for detection of steganographic methods that embed in the spatial domain by adding a low-amplitude independent stego signal, an example of which...
ICPR
2010
IEEE
13 years 11 months ago
2010
IEEE
We propose a novel stochastic graph matching algorithm based on data-driven Markov Chain Monte Carlo (DDMCMC) sampling technique. The algorithm explores the solution space efficien...
ACSAC
2005
IEEE
13 years 10 months ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
WWW
2010
ACM
13 years 12 months ago
2010
ACM
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...