Sciweavers

1722 search results - page 113 / 345
» On the sample mean of graphs
Sort
View
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...
SCP
2002
112views more  SCP 2002»
15 years 6 months ago
Formal agent-oriented modeling with UML and graph transformation
The agent paradigm can be seen as an extension of the notion of (active) objects by concepts like autonomy and cooperation. Mainstream object-oriented modeling techniques do not a...
Ralph Depke, Reiko Heckel, Jochen Malte Küste...
CP
2009
Springer
16 years 7 months ago
Constraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. ...
Christine Solnon, Vianney le Clément, Yves ...
SIGIR
2009
ACM
16 years 25 days ago
Link analysis for private weighted graphs
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
Jun Sakuma, Shigenobu Kobayashi
ACSD
2006
IEEE
105views Hardware» more  ACSD 2006»
16 years 12 days ago
Throughput Analysis of Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
Amir Hossein Ghamarian, Marc Geilen, Sander Stuijk...