1405 search results - page 53 / 281 » Popularity at Minimum Cost |
MICCAI
2005
Springer
15 years 10 months ago
2005
Springer
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
As minimum feature sizes continue to shrink, patterned features have become significantly smaller than the wavelength of light used in optical lithography. As a result, the requir...
DAC
1999
ACM
15 years 2 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
TCS
2008
14 years 9 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...