Sciweavers

334 search results - page 38 / 67
» Practical Parallel Algorithms for Minimum Spanning Trees
Sort
View
IPL
2002
90views more  IPL 2002»
14 years 9 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
NI
2011
168views more  NI 2011»
14 years 15 days ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 2 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck
89
Voted
CVPR
2007
IEEE
15 years 11 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
ICPP
2003
IEEE
15 years 3 months ago
On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
Bin Wang, Sandeep K. S. Gupta