Sciweavers

1545 search results - page 163 / 309
» On tree congestion of graphs
Sort
View
MICCAI
2004
Springer
15 years 11 months ago
Automatic Heart Peripheral Vessels Segmentation Based on a Normal MIP Ray Casting Technique
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...
Charles Florin, Romain Moreau-Gobard, James Willia...
IROS
2006
IEEE
132views Robotics» more  IROS 2006»
15 years 4 months ago
Closing a Million-Landmarks Loop
— 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 ...
Udo Frese, Lutz Schroder
PDCAT
2004
Springer
15 years 3 months ago
An Optimal Broadcasting Algorithm for de Bruijn Network dBG(d, k)
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
Ngoc Chi Nguyen, Sungyoung Lee
CHI
1994
ACM
15 years 2 months ago
Multitrees: enriching and reusing hierarchical structure
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...
George W. Furnas, Jeff Zacks
CPM
2001
Springer
130views Combinatorics» more  CPM 2001»
15 years 2 months ago
On-Line Construction of Compact Directed Acyclic Word Graphs
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...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...