3096 search results - page 165 / 620 » Theory and Use of the EM Algorithm |
152
Voted
ICAPR
2005
Springer
15 years 10 months 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...
182
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
156
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
144
click to vote
PAA
2010
15 years 3 months ago
2010
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
154
click to vote
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...