T. Andreae, M. Nolle, and G. Schreiber. Embedding Cartesian Products of Graphs into de Bruijn Graphs. Internal Report 3/95, Technische Informatik I, TU-HH, February 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Invariant Greyscale Features for 3D Sensordata - Schael, Siggelkow (1998) (Correct)
....possibilities for acceleration of the method: parallel distributed processing and stochastic sampling. As the major amount of calculation time is needed within local computations the method can be easily implemented on parallel or distributed hardware without high communication overhead. e.g. in [1] the parallelization of the algorithm is described for 2D grey scale features. Another possibility for high speedup is to estimate the features by a Monte Carlo method instead of calculating them deterministically [14] The basic idea is not to evaluate f on all samples of figure 1 but to ....
T. Andreae, M. N olle, and G. Schreiber. Embedding cartesian products of graphs into de Bruijn graphs. Journal of Parallel and Distributed Computing, 46(2):194--200, Nov. 1997.
Invariant Greyscale Features for 3D Sensordata - Schael (1998) (Correct)
....a data parallel approach. The overhead to be expected from the necessary data exchange of boundary areas will mainly determine the eciency of the parallel approach. By overlapping the computation with the communication this overhead may be reduced on systems where this technique is applicable. In [1] the parallelization of the algorithm for the construction of 2D greyscale features is described. Based on the results an ecient implementation of the algorithm on 3D data objects can be found. In future work we will use the parallel image processing system PIPS [7] as a basis for the parallel ....
T. Andreae, M. Nolle, and G. Schreiber. Embedding cartesian products of graphs into de Bruijn graphs. 46(2):194-200, November 1997.
Embedding Cartesian Products of Graphs - Into De Bruijn (1997) Self-citation (Andreae Nolle Schreiber) (Correct)
....G is a Cartesian product of two cycles is settled by making use of [1] Theorem 4. We mention that a more direct proof can be based on Lemma 8 without employing the results of [1] and, in fact, the original proof found by the present authors was of this type. The interested reader is referred to [3]. 6 Conclusion This paper presents conditions for the existence (or non existence) of optimal embeddings, i.e. embeddings with unit dilation, load, and expansion, of Cartesian products of graphs into de Bruijn graphs. In particular, we prove that Cartesian products of graphs cannot be ....
T. Andreae, M. Nolle, and G. Schreiber. Embedding Cartesian Products of Graphs into de Bruijn Graphs. Internal Report 3/95, Technische Informatik I, TU-HH, February 1995.
Esprit Bra Iii Project Nat 7130 - Number March (Correct)
No context found.
T. Andreae, M. Nolle, and G. Schreiber, "Embedding Cartesian Products of Graphs into de Bruijn Graphs", Technical report 3/95, Technische Informatik I, TU-HH, February 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC