779 search results - page 73 / 156 » Algorithms for the Sample Mean of Graphs |
158
click to vote
GEOS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Conceptual Graphs are a very powerful knowledge and meaning representation formalism grounded on deep philosophical, linguistic and object oriented principles [1], [2]. C...
147
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
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...
147
click to vote
EMMCVPR
2001
Springer
15 years 9 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
117
click to vote
SAC
2008
ACM
15 years 4 months ago
2008
ACM
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
128
click to vote
DSD
2007
IEEE
15 years 10 months ago
2007
IEEE
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...