2487 search results - page 282 / 498 » Partitions of Graphs into Trees |
103
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
143
Voted
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
127
Voted
MICCAI
2004
Springer
16 years 4 months ago
2004
Springer
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
120
Voted
PDCAT
2004
Springer
15 years 9 months ago
2004
Springer
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
103
Voted
CHI
1994
ACM
15 years 7 months ago
1994
ACM
This paper introduces multitrees, a new type of structure for representing information. Multitrees are a class of directed acyclic graphs (DAGs) with the unusual property that the...