779 search results - page 103 / 156 » Algorithms for the Sample Mean of Graphs |
119
click to vote
TACAS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
185
click to vote
ICPP
1996
IEEE
15 years 8 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...
149
Voted
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper investigates minimizing mutual interferences in wireless ad hoc networks by means of topology control. Prior work defines interference as a relationship between link...
116
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
151
click to vote
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...