1545 search results - page 163 / 309 » On tree congestion of graphs |
170
click to vote
MICCAI
2004
Springer
16 years 7 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...
132
click to vote
IROS
2006
IEEE
16 years 13 days ago
2006
IEEE
— We present an improved version of the treemap SLAM algorithm which uses Cholesky factors for representing Gaussians and a Hierarchical Tree Partitioning algorithm derived from ...
158
click to vote
PDCAT
2004
Springer
15 years 11 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...
136
click to vote
CHI
1994
ACM
15 years 10 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...
160
click to vote
CPM
2001
Springer
15 years 11 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...