779 search results - page 104 / 156 » Algorithms for the Sample Mean of Graphs |
139
click to vote
GBRPR
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
113
click to vote
AAECC
2006
Springer
15 years 8 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
138
click to vote
WADS
1995
Springer
15 years 8 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
126
click to vote
TNN
1998
15 years 4 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
137
click to vote
DLOG
2004
15 years 5 months ago
2004
Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes ...