779 search results - page 65 / 156 » Algorithms for the Sample Mean of Graphs |
135
click to vote
CODES
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
157
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—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...
160
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
127
click to vote
ICWSM
2008
15 years 5 months ago
2008
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
135
click to vote
ISMIS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...