5606 search results - page 256 / 1122 » Randomization Techniques for Graphs. |
174
click to vote
PCM
2007
Springer
16 years 18 days ago
2007
Springer
The two-dimensional Principal Component Analysis (2DPCA) is a robust method in face recognition. Much recent research shows that the 2DPCA is more reliable than the well-known PCA ...
130
click to vote
CEC
2005
IEEE
16 years 3 days ago
2005
IEEE
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
187
click to vote
GBRPR
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
174
click to vote
ICAPR
2005
Springer
16 years 5 hour ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
152
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...