Sciweavers

1550 search results - page 149 / 310
» Benchmarking for Graph Transformation
Sort
View
116
Voted
ICPR
2010
IEEE
15 years 3 months ago
Approximate Belief Propagation by Hierarchical Averaging of Outgoing Messages
Abstract—This paper presents an approximate belief propagation algorithm that replaces outgoing messages from a node with the averaged outgoing message and propagates messages fr...
Koichi Ogawara
JGAA
2006
72views more  JGAA 2006»
15 years 3 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
128
Voted
JMM2
2006
141views more  JMM2 2006»
15 years 3 months ago
Optimal Weighting of Landmarks for Face Recognition
A new method named Landmark Model Matching was recently proposed for fully automatic face recognition. It was inspired by Elastic Bunch Graph Matching and Active Shape Model. Landm...
Rajinda Senaratne, Saman K. Halgamuge
140
Voted
JUCS
2006
87views more  JUCS 2006»
15 years 3 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ML
2011
ACM
179views Machine Learning» more  ML 2011»
14 years 10 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...